On the cost–effectiveness of PRAMs

The authors introduce a formalism which allows to treat computer architecture as a formal optimization problem. They apply this to the design of shared memory parallel machines. Present computers of this type support the programming model of a shared memory. But simultaneous access to the shared memory by several processors is in many situations processed sequentially. Asymptotically good solutions for this problem are offered by theoretical computer science. The authors modify these constructions under engineering aspects and improve the price/performance ratio by roughly a factor of 6. The resulting machine has surprisingly good price/performance ratio even if compared with distributed memory machines. For almost all access patterns of all processors into the shared memory, access is as fast as the access of only a single processor. The re-engineered machine is based on Fluent Machine.<<ETX>>

[1]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[2]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Yukon Chang,et al.  Continuous routing and batch routing on the hypercube , 1986, PODC '86.

[4]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Eli Upfal,et al.  Efficient schemes for parallel communication , 1982, PODC '82.

[6]  B J Smith,et al.  A pipelined, shared resource MIMD computer , 1986 .

[7]  Carlo H. Séquin,et al.  A VLSI RISC , 1982, Computer.

[8]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[9]  Friedhelm Meyer auf der Heide,et al.  A New Universal Class of Hash Functions and Dynamic Hashing in Real Time , 1990, ICALP.

[10]  Helmut Seidl,et al.  FORK: A High-Level Language for PRAMs , 1991, PARLE.

[11]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[12]  Richard M. Karp,et al.  A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .

[13]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[14]  Sandeep N. Bhatt,et al.  The fluent abstract machine , 1988 .