The queue-read queue-write asynchronous PRAM model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1124, Issue , 1996, Pages 279-292

  Gibbons, Phillip B ^a   Matias, Yossi ^a   Ramachandran, Vijaya ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYNCHRONOUS PARALLEL; PRAM MODELS;

QUEUEING THEORY;

EID: 84917682058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024714     Document Type: Conference Paper

References (29)

1. Y. Afek, G. M. Brown, and M. Merritt. Lazy caching. ACM Trans. on Programming Languages and Systems, 15(1):182-205, 1993.
2. M. Adler. Asynchronous shared memory search structures. In Proc. 8th ACM Symp. on Parallel Algorithms and Architectures, June 1996. To appear.
3. C. Armen and D. B. Johnson. Deterministic leader election on the Asynchronous QRQW PRAM. Parallel Processing Letters, 1996. To appear.
4. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in clgn parallel steps. Combinatorica, 3(1): 1-19, 1983.
5. R. J. Anderson. Primitives for asynchronous list compression. In Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, pages 199-208, June-July 1992.
6. G. E. Blelloch, P. B. Gibbons, Y. Matias, and M. Zagha. Accounting for memory bank contention and delay in high-bandwidth multiprocessors. In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 84-94, July 1995.
7. R. Cole. Parallel merge sort. SIAM Journal on Computing, 17(4):770-785, 1988.
8. R. Cole and O. Zajicek. The APRAM: Incorporating asynchrony into the PRAM model. In Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, pages 169-178, June 1989.
9. C. Dwork, M. Herlihy, and O. Waarts. Contention in shared memory algorithms. In Proc. 25th ACM Symp. on Theory of Computing, pages 174-183, May 1993.
10. M. Dietzfelbinger, M. Kutylowski, and R. Reischuk. Exact lower time bounds for computing boolean functions on CREW PRAMs. Journal of Computer and System Sciences, 48(2):231-254, 1994.
11. A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir. The NYU Ultracomputer - designing an MIMD shared memory parallel computer. IEEE Trans. on Computers, C-32 (2):175-189, 1983.
12. P. B. Gibbons. A more practical PRAM model. In Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, pages 158-168, June 1989. Full version in The Asynchronous PRAM: A semi-synchronous model for shared memory MIMD machines, PhD thesis, U.C. Berkeley 1989.
13. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proc. 17th International Symp. on Computer Architecture, pages 15-26, May 1990.
14. P. B. Gibbons and M. Merritt. Specifying nonblocking shared memories. In Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, pages 306-315, June-July 1992.
15. P. B. Gibbons, M. Merritt, and K. Gharachorloo. Proving sequential consistency of high-performance shared memories. In Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 292-303, July 1991.
16. P. B. Gibbons, Y. Matias, and V. Ramachandran. QRQW: Accounting for concurrency in PRAMs and Asynchronous PRAMs. Technical report, AT&T Bell Laboratories, Murray Hill, NJ, March 1993.
17. P. B. Gibbons, Y. Matias, and V. Ramachandran. Efficient low-contention parallel algorithms. Journal of Computer and System Sciences, 1996. To appear. Preliminary version appears in Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 236-247, June 1994.
18. P. B. Gibbons, Y. Matias, and V. Ramachandran. The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms. SIAM Journal on Computing, 1996. To appear. Preliminary version appears in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 638-648, January 1994.
19. P.B. Gibbons, Y. Matias, and V. Ramachandran. The queue-read queue-write asynchronous PRAM model. Technical report, Bell Laboratories, Murray Hill, NJ, and Dept, of Comp. Sci., Univ. of Texas, Austin, TX, June 1996.
20. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
21. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, pages 869-941. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990.
22. P. Liu, W. Aiello, and S. Bhatt. An atomic model for message-passing. In Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, pages 154-163, June-July 1993.
23. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. on Computers, C-28 (9):690-691, 1979.
24. C. Martel, A. Park, and R. Subramonian. Work-optimal asynchronous algorithms for shared memory parallel computers. SIAM Journal on Computing, 21(6):1070-1099, 1992.
25. N. Nishimura. Asynchronous shared memory parallel computation. In Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 76-84, July 1990.
26. R. Reischuk. Probabilistic parallel algorithms for sorting and selection. SIAM Journal on Computing, 14(2):396-409, May 1985.
27. J. H. Reif, editor. A Synthesis of Parallel Algorithms. Morgan-Kaufmann, San Mateo, CA, 1993.
28. B. Smith. Invited lecture, 7th ACM Symp. on Parallel Algorithms and Architectures, July 1995.
29. 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.