Lower bounds for randomized Exclusive Write PRAMs

Theory of Computing Systems

Volumn 30, Issue 6, 1997, Pages 599-626

  MacKenzie, P D ^a  

^a BOISE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACTION; RANDOM PROCESSES;

ASYMPTOTICALLY OPTIMAL; EREW PRAM; LOWER BOUNDS; MULTIPLICATIVE FACTORS; PRAM MODELS;

BOOLEAN FUNCTIONS;

EID: 0031260814     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000070     Document Type: Article

References (29)

1. P. Beame, M. Kik, and M. Kutyłowski. Information broadcasting by exclusive-read PRAMs. Parallel Process. Lett., 4:159-169, 1994.
2. S. Chaudhuri. Sensitive functions and approximate problems. In Proc. 34th Symp. on Foundations of Computer Science, pages 186-193, 1993.
3. S. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput., 15(1):87-97, February 1986.
4. M. Dietzfelbinger, M. Kutyłowski, and R. Reischuk. Exact lower time bounds for computing boolean functions on CREW PRAMs. J. Comput. System Sci., 48:231-254, 1994.
5. F. Fich, M. Kowaluk, M. Kutyłowski, K. Loryś, and P. Ragde. Retrieval of scattered information by EREW, CREW, and CRCW PRAMs. In Proc. 3rd Scandanavian Workshop on Algebraic Theory, pages 30-41. Lecture Notes in Computer Science, Vol. 621. Springer-Verlag, Berlin, 1992.
6. F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson. One, two, three, . . . , infinity: Lower bounds for parallel computation. In Proc. 17th Symp. on Theory of Computing, pages 48-58, 1985.
7. M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Math. System Theory, 17(1):13-27, 1984.
8. P. B. Gibbons, Y. Matias, and V. Ramachandran. Efficient low-contention parallel algorithms. In Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 236-247, 1994.
9. P. B. Gibbons, Y. Matias, and V. Ramachandran. The QRQW PRAM: Accounting for contention in parallel algorithms. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 638-648, 1994.
10. J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. 32nd Symp. on Foundations of Computer Science, pages 698-710, 1991.
11. J. Gil and L. Rudolph. Counting and packing in parallel. In Proc. 15th Internat. Conf. on Parallel Processing, pages 1000-1002, 1986.
12. L. A. Goldberg, M. Jerrum, and P. D. MacKenzie. An Ω(√log log n) lower bound for routing in optical networks. In Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 147-156, 1994.
13. T. Hagerup. Fast parallel space allocation, estimation and integer sorting. Technical Report MPI-I-91-106, Max-Planck-Institut für Informatik, Saarbrücken, 1991.
14. T. Hagerup. Fast deterministic processor allocation. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pages 1-10, 1993.
15. T. Hagerup and M. Kutyłowski. Fast integer merging on the EREW PRAM. In Proc. 19th Internat. Colloq. on Automata, Languages, and Programming, pages 318-329, 1992.
16. T. Hagerup and M. Nowak. Parallel retrieval of scattered information. In Proc. 16th Internat. Colloq. on Automata, Languages, and Programming, pages 439-450, 1989.
17. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A, chapter 17, pages 869-941. MIT Press/Elsevier, Cambridge, MA/Amsterdam, 1990.
18. M. Kutyłowski. Time complexity of boolean functions on CREW PRAMs. SIAMJ. Comput., 20:824-833, 1991.
19. P. D. MacKenzie. The random adversary: A lower bound technique for randomized parallel algorithms and its application to load balancing. To appear in SIAM J. Comput. Preliminary version in Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, pages 94-99, 1992.
20. P. D. MacKenzie. A lower bound for the QRQW PRAM. In Proc. 7th IEEE Symp. on Parallel and Distributed Processing, pages 231-237, 1995.
21. P. D. MacKenzie. An improved lower bound for the QRQW PRAM. In Proc. Workshop on Randomized Parallel Computing, 1996.
22. P. D. MacKenzie and V. Ramachandran. ERCW PRAMs and optical communication. In Proc. Euro-Par '96, pages 293-302. Lecture Notes in Computer Science, Vol. 1124. Springer-Verlag, Berlin, 1996.
23. N. Nisan. CREW PRAMs and decision trees. SIAM J. Comput., 20:999-1007, 1991.
24. N. Nisan and M. Szegedy. On the degree of boolean functions as real polynomials. In Proc. 24th ACM Symp. on Theory of Computing, pages 462-474, 1992.
25. I. Parberry and P. Y. Yan. Improved upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput., 20(1):88-99, 1991.
26. P. Ragde. The parallel simplicity of compaction and chaining. In Proc. 17th Internat. Colloq. on Automata, Languages, and Programming, pages 744-751, 1990.
27. R. Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proc. 19th ACM Symp. on Theory of Computing, pages 77-82, 1987.
28. M. Szegedy. Algebraic methods in lower bounds for computational models with limited communication. Ph.D. thesis. University of Chicago, 1989.
29. A. C.-C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proc. 18th Symp. on Foundations of Computer Science, pages 222-227, 1977.