Skip to main content
SpringerLink
Log in
Book cover

Heinz Nixdorf Symposium at the University of Paderborn

Nixdorf 1992: Parallel Architectures and Their Efficient Use pp 66–67Cite as

The networks of the connection machine CM-5

  • Conference paper
  • First Online:

  • 128 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 678))

This is a preview of subscription content, log in via an institution.

References

  1. C. E. Leiserson, Z. S. Abuhamdeh, D. C. Douglas, C. R. Feynman, M. N. Ganmukhi, J. V. Hill, W. D. Hillis, B. C. Kuszmaul, M. A. St. Pierre, D. S. Wells, M. C. Wong, S.-W. Yang, and R. Zak. The network architecture of the Connection Machine CM-5. In Symposium on Parallel and Distributed Algorithms '92, June 1992.

    Google Scholar 

  2. Thinking Machines Corporation, 245 First Street, Cambridge, MA 02154-1264. The Connection Machine CM-5 Technical Summary, October 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, Massachusetts Institute of Technology, 02142, Cambridge, Massachusetts

    Charles E. Leiserson

Authors
  1. Charles E. Leiserson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Meyer B. Monien A. L. Rosenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leiserson, C.E. (1993). The networks of the connection machine CM-5. In: Meyer, F., Monien, B., Rosenberg, A.L. (eds) Parallel Architectures and Their Efficient Use. Nixdorf 1992. Lecture Notes in Computer Science, vol 678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-56731-3_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56731-8

  • Online ISBN: 978-3-540-47637-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation