The APRAM: Incorporating asynchrony into the PRAM model

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

Volumn , Issue , 1989, Pages 169-178

  Cole, Richard ^a   Zajicek, Ofer ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS;

ASYNCHRONY; COMPLEXITY MEASURES; GRAPH CONNECTIVITY; NON-TRIVIAL ALGORITHMS; PRAM MODELS;

PARALLEL ARCHITECTURES;

EID: 33646422936     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/72935.72954     Document Type: Conference Paper

References (27)

1. [AACS87] A. Aggarwai, B. Alpcrn, A.K. Chandra, and M. Snir. A model for hierarchical memory. In procedding of the 19th Annual ACM Symposium on Theory of Computing, page .105-314, 1987.
2. (AC88a) Alok Aggarwal and Ashok K. Chandra. Commvinic tioi< complexity of PRAMs. In Proceedings of the 15th International Colloquium on Automata, Languages and Programming, pages 1- 17, Springer-Verlag, July 1988.
3. [AC88b] Alok Aggarwai and Ashok K. Chandra. Virtual memory algorithms. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 173-185, 1988.
4. [ACS87] Alok Aggarwai, Ashok K. Chandra, and Marc Snir. Hierarchical memory with block transfer. In Proceedings of the S8th Annual Symposium on the Foundations of Computer Science, pages 204-216, 1987.
5. (ACS88] Alok Aggarwai, Ashok K. Chandra, and Marc Snir. On communication latency in PRAM computations. 1988. Manuscript.
6. [AFL83] Eshrat Arjomandi, Michael J. Fischer, and Nancy A. Lynch. Efficiency of synchronous versus asynchronous distributed systems. Journal of the ACM, 30(3):449-456, July 1983.
7. (AG87] Baruch Awerbuch and Robert G. Gallager. A new distributed algorithm to find breadth first search trees. IEEE Transactions on Information Theory, T-33(3):315-322, May 1987.
8. (Awe85) Baruch Awerbuch. Complexity of Network Synchronization. Journal of the ACM, 32(4):804-823. October 1985.
9. [Awe87] Baruch Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In Proceedings of the 19th Annual A CM Symposium on Theory of Computing, pages 230-240. May 1987.
10. [Bat68] K. E. Batcher. Sorting networks and their applications. AFIPS. 307 314, 1968.
11. [Bau"8] Gerard Maurice Baudct. The Design and Analysis for Asynchronous Multiprocessors. PhD thesis, Carnegie Mellon University, April 1978.
12. [Bre74] R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM. 21(2):201 -206. 1974.
13. (EG88] David Eppstein and Zvi Gali L Parallel Algorithmic Techniques for Combinatorial Computation. Technical Report, Columbia University, February 1988.
14. [Gib89] Phillip B. Gibbons. Towards better shared memory programming models. In Proceeding. of lit ACM Symposium on Parallel Algorithms and/trchitecture.s, 1989.
15. [KR88] R. Karp and V. Ramachandran. A Survey of Parallel Algorithms for Shared Memory Ma-chines Technical Report, Computer Science Division, UC Berkeley, 1988.
16. (KU86) A. Karlin and E. Upfal. Parallel hashing - n efficient implementation of shared memory machine. In Proceedings of the. 18th Annual ACM Symposium on Theory of Computing, pages 160- 168, 1986.
17. [Lam78] Leslie Lamport. Time, docks, and the ordering of events in a distributed system. Communications of the ACM. 21(7):558-563, July 1978.
18. [Lam79] Leslie Lamport. How to make a multiprocessor computer that correctly executes multipro- ctrw programs. IEEE Transactions on Computers, C-28(9)-690-691, September 1979.
19. (LF80] Richard E. Ladner and Michael J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831-838, October 1980.
20. [LF81] Nancy A. Lynch and Michael J. Fischer. On describing the behavior and implementation of distributed systems. Theoretical Computer Science, 13:17 43, 1981.
21. [PF77] Gary L. Peterson and Michael J. Fischer. Eco- nomical solutions for the Critical Scction Problem in a distributed system. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing, pages 91-97, May 1977.
22. (PU87) Christo H. Papadimitrion and Jeffrey D. UH- Man. A comramunication-Time tradeoff. SI AM Journal on Computing, 16{4}:639-616. August.
23. [Ran87] A. G. Ranade. How to Emulate Shared Memory. In Proceedings of the 28th Annual Symposium on the Foundation of Computer Science, pages 185- 194, 1987.
24. [Sni87] Marc Snir. Public talk. 1987. New York University.
25. [SS88] Dennis Shasha and Marc Snir. Efficient and correct execution of parallel programs that share memory. ACM Transactions on Programming Languages and Systems, 10(2):282-312, Apnl.
26. [SV82] Yossi Shiloach and Uri Vishkin. An O(Iogn) parallel connectivity algorithm. Journal of Al-gorithms, 3:57-67, 1982.
27. [Wyl79] James C. Wyllie. The Complexity of Parallel Computation. PhD thesis, Cornell University, August 1979. Technical report number TR 79-387, Department of Computer Science.