The queue-read queue-write asynchronous PRAM model

Theoretical Computer Science

Volumn 196, Issue 1-2, 1998, Pages 3-29

  Gibbons, P B ^a   Matias, Y ^a   Ramachandran, V ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b University of Texas at Austin   (United States)

Author keywords

Asynchronous PRAM; Models of parallel computation; Parallel algorithms; QRQW; Sorting

Indexed keywords

EID: 0008757016     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00193-X     Document Type: Article

References (35)

1. M. Adler, Asynchronous shared memory search structures, in: Proc. 8th ACM Symp. on Parallel Algorithms and Architectures, June 1996, pp. 42-51.
2. Y. Afek, G.M. Brown, M. Merritt, Lazy caching, ACM Trans. Programming Languages and Systems 15 (1) (1993) 182-205.
3. M. Ajtai, J. Komlos, K. Szemeredi, Sorting in c log n parallel steps, Combinatorica 3 (1) (1983) 1-19.
4. R.J. Anderson, Primitives for asynchronous list compression, in: Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, June-July 1992, pp. 199-208.
5. C. Armen, D.B. Johnson, Deterministic leader election on the Asynchronous QRQW PRAM, Parallel Process. Lett. 1996, to appear.
6. Y. Aumann, M.O. Rabin, Clock construction in fully asynchronous parallel systems and PRAM simulation, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science, October 1992, pp. 147-156.
7. K.E. Batcher, Sorting networks and their applications, in: Proc. AFIPS Spring Joint Summer Computer Conference, 1968, pp. 307-314.
8. P. Beame, J. Håstad, Optimal bounds for decision problems on the CRCW PRAM, J. ACM 36 (3) (1989) 643-670.
9. G.E. Blelloch, P.B. Gibbons, Y. Matias, M. Zagha, Accounting for memory bank contention and delay in high-bandwidth multiprocessors, in: Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, July 1995, pp. 84-94.
10. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (4) (1988) 770-785.
11. R. Cole, O. Zajicek, The APRAM: incorporating asynchrony into the PRAM model, in: Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, June 1989, pp. 169-178.
12. R. Cole, O. Zajicek, The expected advantage of asynchrony, in: Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures. July 1990, pp. 85-94.
13. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proc. 4th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, May 1993, pp. 1-12.
14. M. Dietzfelbinger, M. Kutyłowski, R. Reischuk, Exact lower time bounds for computing boolean functions on CREW PRAMs, J. Comput. System Sci. 48 (2) (1994) 231-254.
15. C. Dwork, M. Herlihy, O. Waarts, Contention in shared memory algorithms, in: Proc. 25th ACM Symp. on Theory of Computing, May 1993, pp. 174-183.
16. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, J. Hennessy, Memory consistency and event ordering in scalable shared-memory multiprocessors, in: Proc. 17th Internat. Symp. on Computer Architecture, May 1990, pp. 15-26.
17. P.B. Gibbons, A more practical PRAM model, in: Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, June 1989, pp. 158-168. Full version in: The Asynchronous PRAM: a semi-synchronous model for shared memory MIMD machines, Ph D. thesis, U.C. Berkeley, 1989.
18. P.B. Gibbons, A more practical PRAM model, in: Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, June 1989, pp. 158-168. Full version in: The Asynchronous PRAM: a semi-synchronous model for shared memory MIMD machines, Ph D. thesis, U.C. Berkeley, 1989.
19. P.B. Gibbons, M. Merritt, Specifying nonlocking shared memories, in: Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, June-July 1992, pp. 306-315.
20. P.B. Gibbons, M. Merritt, K. Gharachorloo, Proving sequential consistency of high-performance shared memories, in: Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, July 1991, pp. 292-303.
21. P.B. Gibbons, Y. Matias, V Ramachandran, QRQW. Accounting for concurrency in PRAMs and Asynchronous PRAMs, Technical report, AT&T Bell Laboratories, Murray Hill, NJ, March 1993.
22. P.B. Gibbons, Y. Matias, V. Ramachandran, Efficient low-contention parallel algorithms, J. Comput. System Sci. 53 (3) (1996) 417-442; Special issue devoted to selected papers from the 1994 ACM Symp. on Parallel Algorithms and Architectures.
23. P.B. Gibbons, Y. Matias, V. Ramachandran, The queue-read queue-write PRAM model: accounting for contention in parallel algorithms, SIAM J. Comput. 1997, to appear. Preliminary version appears in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, January 1994, pp. 638-648.
24. P.B. Gibbons, Y. Matias, V. Ramachandran, The queue-read queue-write PRAM model: accounting for contention in parallel algorithms, SIAM J. Comput. 1997, to appear. Preliminary version appears in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, January 1994, pp. 638-648.
25. A. Gottlieb, R. Grishman, C.P Kruskal, K.P. McAuliffe, L. Rudolph, M. Snir. The NYU Ultracomputer - designing an MIMD shared memory parallel computer, IEEE Trans. Comput. C-32 (2) (1983) 175-189.
26. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
27. R.M. Karp, V. Ramachandran, Parallel algorithms for shared-memory machines, in: J van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A, Elsevier, Amsterdam, 1990, pp. 869-941.
28. L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Trans. Comput. C-28 (9) (1979) 690-691.
29. P. Liu, W. Aiello, S. Bhatt, An atomic model for message-passing, in: Proc. 5th ACM Symp. on Parallel Algorithms and Architectures. June July 1993, pp. 154-163.
30. C. Martel, A. Park, R. Subramonian, Work-optimal asynchronous algorithms for shared memory parallel computers, SIAM J. Comput. 21 (6) (1992) 1070-1099.
31. N. Nishimura, Asynchronous shared memory parallel computation, in: Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, July 1990, pp. 76-84.
32. J.H. Reif (Ed.), A Synthesis of Parallel Algorithms, Morgan-Kaufmann, San Mateo, CA. 1993.
33. R. Reischuk, Probabilistic parallel algorithms for sorting and selection, SIAM J. Comput. 14 (2) (1985) 396-409.
34. B. Smith, Invited lecture, 7th ACM Symp. on Parallel Algorithms and Architectures, July 1995.
35. U. Vishkin, On choice of a model of parallel computation, Technical Report 61, Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer St., New York, NY 10012, 1983.