More practical PRAM model

Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Volumn , Issue , 1989, Pages 158-168

  Gibbons, Phillip B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

LOWER BOUNDS; PRAM MODELS; SHARED MEMORY;

MEMORY ARCHITECTURE;

EID: 84976711671     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/72935.72953     Document Type: Conference Paper

References (19)

1. [ACS89] Alok Aggarwal, Ashok K. Chandra, and Marc Snir. On communication latency in PRAM computations. In Proc, of the Symp. on Parallel Algorithms and Architectures (SPAA), 1989.
2. [AKS83] M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in clogn parallel steps. Combinatorica, 3:1-19, 1983.
3. [AM88] Richard J. Anderson and Gary L. Miller. Deterministic parallel list ranking. In John H. Reif, editor, Lecture Notes in Computer Science, Vol. S19, pages 81-90. Springer-Verlag, Berlin, 1988. Proc. of the 3rd Aegean Workshop on Computing (AWOC).
4. [Bre74] R. P. Brent. The parallel evaluation of general arithmetic expressions. J ACM, 21:201-208, 1974.
5. [CV86a] Richard Cole and Uzi Vishkin. Approximate and exact parallel scheduling with applica-Tions to list, tree, and graph problems. In Proc. of the Symp. on Foundations of Computer Science (FOCS), pages 478-491, 1986.
6. [CV86b] Richard Cole and Uzi Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70:32-53, 1986.
7. [CW87] D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proc. of the Symp. on Theory of Computing (STOC), pages 1-6, 1987.
8. [CZ89] Richard Cole and Ofer Zajicek. The APRAM: Incorporating asynchrony into the PRAM model. In Proc. of the Symp. on Parallel Algorithms and Architectures (SPAA), 1989.
9. [Eck79] Diane M. Eckstein. Simultaneous memory access. Technical Report TR-79-6, Computer Science Dept., Iowa State University, Ames, Iowa, 1979.
10. [Kar88] Richard M. Karp. personal communication, 1988.
11. [KR88] Richard M. Karp and Vijaya L, Ramachan-dran. A survey of parallel algorithms for shared-memory machines. Technical Report UCB-CSD-88-408, Computer Science Division, University of California, Berkeley, March 1988. To appear in Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1989.
12. [KRS88] Clyde P. Kruskal, Larry Rudolph, and Marc Snir. A complexity theory of efficient paral-lel algorithms. Technical Report RC 13572, IBM T. J. Watson Research Center, York-Town Heights, New York, March 1988.
13. [KU86] Anna Karlin and Eli Upfal. Parallel hashing -An efficient implementation of shared memory. In Proc. of the Symp. on Theory of Computing (STOC), pages 160-168, 1986.
14. [LF81] N. A. Lynch and M. J. Fisher. On describing the behavior of an implementation of dis-Tributed systems. Theoretical Computer Science, 13:17-43, 1981.
15. [MRK88] Gary L. Miller, Vijaya L. Ramachandran, and E. Kaltofen. Efficient parallel evaluation of straight-line code and arithmetic circuits. SIAM Journal on Computing, 1988.
16. [PY88] Christos H. Papadimitriou and Mihalis Yannakakis. Towards an architecture- independent analysis of parallel algorithms. In Proc. of the Symp. on Theory of Computing (STOC), pages 510-513, 1988.
17. [Ran87] A. Ranade. How to emulate shared memory. In Proc. of the Symp. on Foundations of Computer Science (FOCS), pages 185-194, 1987.
18. [Sni88] Marc Snir. personal communication, 1988.
19. [TV85] Robert E. Tarjan and Uzi Vishkin. An efficient parallel biconnectivity algorithm. SIAM Journal on Computing, 14:862-874, 1985.