The network architecture of the connection machine CM-5

Journal of Parallel and Distributed Computing

Volumn 33, Issue 2, 1996, Pages 145-158

  Leiserson, Charles E ^a   Abuhamdeh, Zahi S ^a   Douglas, David C ^a   Feynman, Carl R ^a   Ganmukhi, Mahesh N ^a   Hill, Jeffrey V ^a   Hillis, W Daniel ^a   Kuszmaul, Bradley C ^a   Pierre, Margaret A St ^a   Wells, David S ^a   Wong Chan, Monica C ^a   Yang, Shaw Wen ^a   Zak, Robert ^a  

^a SUN MICROSYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 16144366475     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0033     Document Type: Article

References (25)

1. 1. IEEE Std 1149.1-1990, IEEE standard test access port and boundaryscan architecture, 1990.
2. 2. G. E. Blelloch, Vector Models for Data-Parallel Computing. The MIT Press, Cambridge, MA, 1990.
3. 3. W. J. Dally, Wire-efficient VLSI multiprocessor communication networks. In Paul Losleben (Ed.). Proceedings of the 1987 Stanford Conference on Advanced Research in VLSI, pp. 391-415, The MIT Press, Cambridge, MA, 1987.
4. 4. W. J. Dally and C. L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. C-36(5), 547-553 (May 1987).
5. 5. F. Darema-Rogers, D. A. George, V. A. Norton, and G. F. Pfister, A single-program-multiple-data computational model for EPEX/ FORTRAN. Research Report RC11552, Computer Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights, NY, Nov. 1986.
6. 6. M. Dubois and S. Thakkar (Eds.), Cache Architectures in Tightly Coupled Multiprocessors. IEEE Comput. Soc., Los Alamitos, CA, June 1990. Special Issue of Computer 23(6).
7. 7. M. J. Flynn, Very high speed computing systems. Proc. IEEE 54(12), 1901-1909 (Dec. 1966).
8. 8. A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, The NYU Ultracomputer-designing a MIMD, shared-memory parallel machine. IEEE Trans. Comput. C-32(2), 175-159 (Feb. 1983).
9. 9. R. I. Greenberg and C. E. Leiserson, Randomized routing on fat-trees. Adv. Comput. Res. 5, 345-374 (1989).
10. 10. R. Gupta, The fuzzy barrier. A mechanism for highspeed synchronization of processors. In Third International Conference on Architectural Support for Programming Languages and Operating Systems, Boston, MA 1989, pp. 54-63.
11. 11. H. F. Jordan, A multi-microprocessor system for finite element structural analysis. In A. K. Noor and H. G. McComb, Jr. (Eds.). Trends in Computerized Structural Analysis and Synthesis, pp. 21-29. Pergamon, 1978. Published as a special issue of Comput. Structures 10(1-2).
12. 11. H. F. Jordan, A multi-microprocessor system for finite element structural analysis. In A. K. Noor and H. G. McComb, Jr. (Eds.). Trends in Computerized Structural Analysis and Synthesis, pp. 21-29. Pergamon, 1978. Published as a special issue of Comput. Structures 10(1-2).
13. 12. P. Kermani and L. Kleinrock, Virtual cut-through: A new computer communication switching technique. Comput. Networks 3, 267-286 (1979).
14. 13. L. Kleinrock, Principles and lessons in packet communications. Proc. IEEE 66(11), 1320-1329 (Nov. 1978).
15. 14. F. T. Leighton, B. Maggs, and S. Rao, Universal packet routing algorithms. In 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 256-271.
16. 15. C. E. Leiserson, Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. C-34(10), 892-901, (Oct. 1985).
17. 16. C. E. Leiserson and B. M. Maggs, Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica 3, 53-77 (1988).
18. 17. M. St. Pierre, S.-W. Yang, and D. Cassiday. Functional VLSI design verification methodology for the CM-5 massively parallel supercomputer. In 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors (ICCD '92) Oct. 1992, pp. 430-445.
19. 18. C. L. Seitz, The Cosmic Cube. Comm. ACM 28(1), 22-23, (Jan. 1985).
20. 19. C. L. Seitz, W. C. Athas, W. J. Dally, R. Faucette, A. J. Martin, S. Mattisson, C. S. Steele, and W.-K. Su, Message-Passing Concurrent Computers: Their Architecture and Programming. Addison-Wesley, Reading, MA, 1986.
21. 20. P. Tang and P.-C. Yew, Processor self-scheduling for multiple-nested parallel loops. In K. Hwang, S. M. Jacobs, and E. E. Swartzlander (Eds.). Proceedings of the 1986 International Conference on Parallel Processing, Aug. 1986, pp. 528-535.
22. 21. Texas Instruments, SN54ACT8997, SN74ACT8997 Scan Path Linker with 4-bit identification bus, April 1990. Product Preview.
23. 22. Thinking Machines Corporation (applicant) and W. Daniel Hillis (inventor), European Patent Application Serial Number 89 902 461.6, priority date of Feb. 2, 1988, entitled Method and Apparatus for Aligning the Operation of a Plurality of Processors. Also, International Application Number WO 89/07299 (published under the Patent Cooperation Treaty), publication date 10 August 1989.
24. 23. Thinking Machines Corporation, The Connection Machine CM-5 Technical Summary, Oct. 1991.
25. 24. R. Zak and J. Hill, An IEEE 1149.1 compliant testability architecture with internal scan. In 1992 IEEE International Conference on Compater Design: VLSI in Computers & Processors (ICCD '92), Oct. 1992, pp. 436-443.