Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1993: Algorithms and Data Structures pp 163–174Cite as

Separating the power of EREW and CREW PRAMs with small communication width

  • Conference paper
  • First Online:

  • 147 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 709))

Abstract

We prove that evaluating a Boolean decision tree of height h requires Ω(h/log* h) time on any EREW PRAM with communication width one. Since this function can be easily solved in time O(√h) on a CREW PRAM with communication width one, this gives a separation between the two models. Our result can be extended to show a separation whenever the EREW PRAM has communication width m ε o(√h).

Beame and Sinha's research supported by NSF/DARPA under grant CCR-8907960 and NSF under grant CCR-8858799. Fich's research supported by the Natural Science and Engineering Research Council of Canada and the Information Technology Research Centre of Ontario.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Beame. Lower Bounds in Parallel Machine Computation. PhD thesis, Department of Computer Science, University of Toronto, 1986. Also appears as Technical Report TR 198/87.

    Google Scholar 

  2. Steven A. Cook, Cynthia Dwork, and Rudiger Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM Journal on Computing, 15(1):87–97, February 1986.

    Article  Google Scholar 

  3. M. Dietzfelbinger, M. Kutylowski, and R. Reischuk. Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 125–135, Crete, Greece, June 1990.

    Google Scholar 

  4. Faith E. Fich and Avi Wigderson. Towards understanding exclusive read. SIAM Journal on Computing, 19(4):717–727, 1990.

    Article  Google Scholar 

  5. E Gafni, J Naor, and P Ragde. On separating the EREW and CREW PRAM models. Theoretical Computer Science, 68(3):343–346, 1989.

    Article  Google Scholar 

  6. M. Kutyloswski. The complexity of Boolean functions on CREW PRAMs. SIAM Journal on Computing, 20(5):824–833, 1991.

    Article  Google Scholar 

  7. Noam Nisan. CREW PRAMs and decision trees. SIAM Journal on Computing, 20(6):999–1007, December 1991.

    Article  Google Scholar 

  8. M. Snir. On parallel searching. SIAM Journal on Computing, 14:688–708, 1985.

    Google Scholar 

  9. U. Vishkin and A. Wigderson. Trade-offs between depth and width in parallel computation. SIAM Journal on Computing, 14(2):303–314, May 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering, University of Washington, 98195, Seattle, WA, USA

    Paul Beame & Rakesh K. Sinha

  2. Computer Science, University of Toronto, M5S 1A4, Toronto, Ontario, Canada

    Faith E. Fich

Authors
  1. Paul Beame
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Faith E. Fich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rakesh K. Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro Sue Whitesides

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beame, P., Fich, F.E., Sinha, R.K. (1993). Separating the power of EREW and CREW PRAMs with small communication width. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_245

Download citation

  • DOI: https://doi.org/10.1007/3-540-57155-8_245

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57155-1

  • Online ISBN: 978-3-540-47918-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation