The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer

IEEE Transactions on Computers

Volumn C-32, Issue 2, 1983, Pages 175-189

  Rudolph, Larry ^c   Grishman, Ralph ^a   McAuliffe, Kevin P ^a   Snir, Marc ^a   Kruskal, Clyde P ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Computer architecture; fetch and add; MIMD; multiprocessor; omega network; parallel computer; parallel processing; shared memory; systolic queues; VLSI

Indexed keywords

COMPUTER SYSTEMS, DIGITAL;

EID: 0020705129     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1983.1676201     Document Type: Article

References (45)

1. R. Bianchini and R. Bianchini, Jr., “Wireability of the NYU Ultracomputer,” Courant Institute, NYU, NY, Ultracomputer Note 43, 1982.
2. A. Borodin and J. E. Hopcroft, “Routing, merging, and sorting on parallel models of computation,” in Proc. 14th Annu. Ass. Comput. Mach. Symp. Theory Computing, 1982, pp. 338–344.
3. Burroughs Corp., “Numerical aerodynamic simulation facility feasibility study,” NAS2-9897, Mar. 1979.
4. Denelcor Corp., “Heterogeneous element processor principles of operation,” Denver, CO, Pub. 9 000 001, 1981.
5. N. Deo, C. Y. Pang, and R. E. Lord, “Two parallel algorithms for shortest path problems,” in Int. Conf. Parallel Processing, 1980, pp. 244–253.
6. D. Dias and J. R. Jump, “Analysis and simulation of buffered delta networks,” IEEE Trans. Comput., vol. C-30, pp. 273–282, 1981.
7. L. R. Goke and G. J. Lipovsky, “Banyan networks for partitioning multiprocessor systems,” in Proc. 1st Annu. Symp. Comput. Arch., 1973, pp. 21–28.
8. A. Gottlieb, “PLUS-A PL/I based Ultracomputer simulator I,” Courant Institute, NYU, NY, Ultracomputer Note 10, 1980.
9. A. Gottlieb, “WASHCLOTH-The logical successor to soapsuds,” Courant Institute, NYU, NY, Ultracomputer Note 12, 1980.
10. A. Gottlieb, “PLUS-A “PLUS—A PL/I based Ultracomputer simulator II,” Courant Institute, NYU, NY, Ultracomputer Note 14, 1980.
11. A. Gottlieb and C. P. Kruskal, “MULT-A multitasking Ultracomputer language with timing, I & II,” Courant Institute, NYU, NY, Ultracomputer Note 15, 1980.
12. A. Gottlieb and C. P. Kruskal, “Coordinating parallel processors: A partial unification,” Comput. Arch. News, pp. 16–24, Oct. 1981.
13. A. Gottlieb, B. Lubachevsky, and L. Rudolph, “Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors,” ACM TOPLAS, Jan. 1983.
14. A. Gottlieb and J. T. Schwartz, “Networks and algorithms for very large scale parallel computations,” Computer, vol. 15, pp. 27–36, Jan. 1982.
15. L. J. Guibas and F. M. Liang, “Systolic stacks, queues, and counters,” in Proc. Conf. Advanced Research VLSI, Jan. 1982.
16. R. G. Jacobsen and D. P. Misunas, “Analysis of structures for packet communications,” in Proc. Int. Conf. Parallel Processing, 1977.
17. S. D. Johnson, “Connection networks for output-driven list multiprocessing,” Dept. Comput. Sci., Indiana Univ., Indiana, PA, Tech. Rep. 114, 1981.
18. M. Kalos, “Scientific calculations on the Ultracomputer,” Courant Institute, NYU, NY, Ultracomputer Note 30, 1981.
19. M. Kalos, G. Leshem, and B. D. Lubachevsky, “Molecular simulations of equilibrium properties,” Courant Institute, NYU, NY, Ultracomputer Note 27, 1981.
20. K. R. Kaplan and R. V. Winder, “Cache-based computer systems,” Computer, vol. 6, pp. 30–36, 1973.
21. D. Klappholz, private communication, 1981.
22. D. Korn, “Timing analysis for scientific codes run under WASHCLOTH simulation,” Courant Institute, NYU, NY, Ultracomputer Note 24, 1981.
23. D. Kroft, “Lockup-free instruction fetch/prefetch cache organization,” in Proc. 8th Annu. Symp. Comput. Arch., 1981, pp. 81–88.
24. C. P. Kruskal, “Upper and lower bounds on the performance of parallel algorithms,” Ph.D. dissertation, Courant Institute, NYU, NY, 1981.
25. C. P. Kruskal, “Replace-add based paracomputer algorithms,” in Proc. Int. Conf. Parallel Processing, 1982.
26. C. P. Kruskal and M. Snir, “Some results on multistage interconnection networks for multiprocessors,” Courant Institute, NYU, NY, Ultracomputer Note 41, 1982;also in Proc. Princeton Conf. Inform. Sci. Syst., 1982.
27. H. T. Kung, “The structure of parallel algorithms,” in Advances in Computers, vol. 19, M. C. Yovits Ed. New York: Academic, 1980, 65–112.
28. L. Lamport, “How to make a multiprocessor computer that correctly executes multiprocess programs,” IEEE Trans. Comput., vol. C-28, pp. 690–691, 1979.
29. D. Lawrie, “Access and alignment of data in an array processor,” IEEE Trans. Comput., vol. C-24, pp. 1145–1155, 1975.
30. G. Radin, “The 801 minicomputer,” in Symp. Architectural Support Programming Languages and Operating Systems, 1982, pp. 39–47.
31. D. P. Reed and R. K. Kanodia, “Synchronization with eventcounts and sequencers,” Commun. Ass. Comput. Mach., vol. 22, pp. 115–123, 1979.
32. G. Rodrigue, E. D. Giroux, and M. Pratt, “Perspectives on large-scale scientific computing,” Computer, vol. 13, pp. 65–80, Oct. 1980.
33. L. S. Rudolph, “Software structures for ultraparallel computing,” Ph.D. dissertation, Courant Institute, NYU, NY, 1981.
34. N. Rushfield, “Atmospheric computations on highly parallel MIMD computers,” Courant Institute, NYU, NY, Ultracomputer Note 22, 1981.
35. J. T. Schwartz, “Preliminary thoughts on Ultracomputer programming style,” Courant Institute, NYU, NY, Ultracomputer Note 3,1979.
36. J. T. Schwartz, “Ultracomputers,” ACM TOPLAS, pp. 484–521, 1980.
37. H. J. Siegel and R. J. McMillen, “Using the augmented data manipulator in PASM,” Computer, vol. 14, pp. 25–34, 1981.
38. B. J. Smith, “A pipelined shared resource MIMD computer,” in Proc. Int. Conf. Parallel Processing, 1978, pp. 6–8.
39. M. Snir, “NETSIM-Network Simulator for the Ultracomputer,” Courant Institute, NYU, NY, Ultracomputer Note 28,1981.
40. M. Snir and J. Solworth, “The ultraswitch-A VLSinetwork node for parallel processing,” Courant Institute, NYU, NY, Ultracomputer Note 39,1982.
41. H. S. Stone, “Parallel computers,” in Introduction to Computer Architecture, H. S. Stone, Ed. Chicago, IL: SRA, 1980, pp. 318–347.
42. H. Sullivan, T. Bashkow, and D. Klappholz, “A large scale homogeneous, fully distributed parallel machine,” in Proc. 4th Annu. Symp. Comput. Arch., 1977, pp. 105–124.
43. R. J. Swan, S. H. Fuller, and D. P. Siewiorek, “Cm*— A modular, multi-microprocessor,” in Proc. AFIPS Conf., vol. 46, 1977, pp. 637–644.
44. D. S. Wise, “Compact layout of Banyan/FFT networks,” in Proc. CMU Conf. VLSI Systems and Computations, Kung, Sproull, and Steele, Eds. Rockville, MD: Computer Science Press, 1981, pp. 186–195.
45. G. H. Gonnet, “Expected length of the longest probe sequence in hash code searching,” J. Ass. Comput. Mach., pp. 289–304, Apr. 1981.