Beyond Parallel Random-Access Machines

The fundamental paradigm in theoretical computer science is to propose a formal model of computation, and then to analyze the complexity of different problems in the model. However, if the model fails to reflect constraints in the real world, these analyses have limited practical importance. The parallel random-access machine (PRAM) is by far the most popular model of parallel computation. Hundreds of algorithms have been designed for the PRAM. Yet, the PRAM ignores contraints on communication imposed by modern electronic packaging technology.

[1]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

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

[3]  Abhiram G. Ranade,et al.  How to emulate shared memory (Preliminary Version) , 1987, FOCS.

[4]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[5]  Arnold L. Rosenberg,et al.  Three-Dimensional Circuit Layouts , 1984, SIAM J. Comput..

[6]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[7]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.