A Critique of the PRAM Model of Computation
Reference10 articles.
1. A. Aggarwal and A.K. Chandra, “Communication complexity of PRAMs,” Proc. of the 15th Int. Coll. on Automata, Lannguages and Programming, 1988, pp. 1–18.
2. A. Aggarwal, A. Chandra and M. Snir, “On Communication Latency in PRAM Computations,” Manuscript, 1988.
3. A. Karp, “Programming for Parallelism,” IEEE Computer, May 1987.
4. R. Koch, T. Leighton, B. Maggs, S. Rao and A. Rosenberg, “Work-Preserving Simulations of Fixed-Connection Networks,” Manuscript, 1988.
5. C. E. Leiserson and B. M. Maggs, “Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines,” Algorithmica, Vol. 3, pp. 53–77.