Separating the Power of EREW and CREW PRAMs with Small Communication Width

Information and Computation

Volumn 138, Issue 1, 1997, Pages 89-99

  Beame, Paul ^a   Fich, Faith E ^b   Sinha, Rakesh K ^a  

^a University of Washington   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003328490     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2649     Document Type: Article

References (12)

1. Beame, P. (1986), "Lower Bounds in Parallel Machine Computation," Ph.D. thesis, Department of Computer Science, University of Toronto. Also appears as Technical Report TR 198/87.
2. Cook, Steven A., Dwork, Cynthia, and Reischuk, Rudiger (1986), Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15(1), 87-97.
3. Dietzfelbinger, M., Kutylowski, M., and Reischuk, R. (1990), Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes, in "Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, Crete," pp. 125-135.
4. Dymond, P. W., and Ruzzo, W. L. (1986), Parallel random access machines with owned global memory and deterministic context-free language recognition, in "Automata, Languages, and Programming: 13th International Colloquium" (Laurent Kott, Ed.), Lecture Notes in Computer Science, Vol. 226, pp. 95-104, Springer-Verlag, Rennes, France.
5. Fich, Faith E. (1993), The complexity of computation on the parallel random access machine, in "Synthesis of Parallel Algorithms" (John H. Reif, Ed.), pp. 843-900, Morgan Kaufman, San Mateo, CA.
6. Fich, Faith E., and Wigderson, Avi (1990), Towards understanding exclusive read, SIAM J. Comput. 19(4), 717-727.
7. Gafni, E., Naor, J., and Ragde, P. (1989), On separating the EREW and CREW PRAM models, Theoret. Comput. Sci. 68(3), 343-346.
8. JáJá, Joseph (1992), "An Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA.
9. Kutyłowski, M. (1991), The complexity of Boolean functions on CREW PRAMs, SIAM J. Comput. 20(5), 824-833.
10. Nisan, Noam (1991), CREW PRAMs and decision trees, SIAM J. Comput. 20(6), 999-1007.
11. Snir, M. (1985), On parallel searching, SIAM J. Comput. 14(3), 688-708.
12. Vishkin, U., and Wigderson, A. (1985), Trade-offs between depth and width in parallel computation, SIAM J. Comput. 14(2), 303-314.