Retrieval of scattered information by EREW, CREW, and CRCW PRAMs

Abstract

Thek-compaction problem arises whenk out ofn cells in an array are non-empty and the contents of these cells must be moved to the firstk locations in the array. Parallel algorithms fork-compaction have obvious applications in processor allocation and load balancing;k-compaction is also an important subroutine in many recently developed oped parallel algorithms. We show that any EREW PRAM that solves thek-compaction problem requires\(\Omega (\sqrt {\log n} )\) time, even if the number of processors is arbitrarily large andk=2. On the CREW PRAM, we show that everyn-processor algorithm fork-compaction problem requires Ω(log logn) time, even ifk=2. Finally, we show thatO(logk) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    H. Bast and T. Hagerup, Fast and Reliable Parallel Hashing. InProc. 3rd Ann. ACM Symp. Parallel Algorithms and Architectures, 1991, 50–61.

  2. [2]

    P. Beame,Lower Bounds in Parallel Machine Computation. Ph.D. thesis, University of Toronto, 1986.

  3. [3]

    P. Beame, M. Kik, andM. Kutyłowski, Information Broadcasting by Exclusive Read PRAMs.Parallel Processing Letters 4.1&2 (1994), 159–169.

    Google Scholar 

  4. [4]

    C. Berge,Graphs and Hypergraphs. North-Holland, Amsterdam, 1976.

    Google Scholar 

  5. [5]

    R. Cole, Parallel Merge Sort.SIAM J. Comput. 17 (1988), 770–785.

    Google Scholar 

  6. [6]

    S. Cook, C. Dwork, andR. Reischuk, Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes.SIAM J. Comput. 15 (1986), 87–97.

    Google Scholar 

  7. [7]

    M. Dietzfelbinger, M. Kutyłowski, andR. Reischuk, Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes.J. Comput. System Sci. 48 (1994), pp. 231–254.

    Google Scholar 

  8. [8]

    F. E. Fich, R. Impagliazzo, B. Kapron, V. King, andM. Kutyłowski, Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. InProc. 10th Ann. Symp. Theoret. Aspects Comput. Sci., Lecture Notes in Computer Science665, Springer-Verlag, Berlin, 1993, 386–397.

    Google Scholar 

  9. [9]

    F. E. Fich, P. Ragde, andA. Wigderson, Relations Between Concurrent-Write Models of Parallel Computation.SIAM J. Comput. 17 (1988), 606–627.

    Google Scholar 

  10. [10]

    J. Gil and Y. Matias, Fast Hashing on a PRAM-Designing by Expectation. InProc. 2nd Ann. ACM Symp. Discrete Algorithms, 1991, 271–280.

  11. [11]

    J. Gil, Y. Matias, and U. Vishkin, Towards a Theory of Nearly Constant Parallel Time Algorithms. InProc. 32nd Ann. IEEE Symp. Found. Comput. Sci., 1991, 698–710.

  12. [12]

    J. Gil and L. Rudolph, Counting and Packing in Parallel. InProc. 1986 Int. Conf. Parallel Processing, IEEE Comput. Soc. Press, 1986, 1000–1002.

  13. [13]

    M. Goodrich, Using Approximation Algorithms to Design Parallel Algorithms that may Ignore Processor Allocation. InProc. 32nd Ann. IEEE Symp. Found. Comput. Sci., 1991, 711–722.

  14. [14]

    T. Hagerup. Personal communication.

  15. [15]

    T. Hagerup, Fast and Optimal Simulations between CRCW PRAMs. InProc. 9th Symp. Theoret. Aspects Comput. Sci., Lecture Notes in Computer Science577, Springer-Verlag, Berlin, 1992, 45–56.

    Google Scholar 

  16. [16]

    T. Hagerup, The Log-Star Revolution. InProc. 9th Symp. Theoret. Aspects Comput. Sci., Lecture Notes in Computer Science578, Springer-Verlag, Berlin, 1992, 259–278.

    Google Scholar 

  17. [17]

    T. Hagerup andM. Nowak, Parallel Retrieval of Scattered Information. InProc. 16th Int. Colloq. Automata Languages and Programming, Lecture Notes in Computer Science372, Springer-Verlag, Berlin, 1989, 439–450.

    Google Scholar 

  18. [18]

    T. Hagerup and T. Radzik, Every ROBUST CRCW PRAM can Efficiently Simulate a PRIORITY PRAM. InProc. 2nd ACM Symp. Parallel Algorithms and Architectures, 1990, 125–135.

  19. [19]

    M. Kutyłowski, Time Complexity of Boolean Functions on CREW PRAMs.SIAM J. Comput. 20 (1991), 824–833.

    Google Scholar 

  20. [20]

    P. D. MacKenzie, Lower Bounds for Randomized Exclusive Write PRAMs InProc. 7th Ann. ACM Symp. Parallel Algorithms and Architectures, 1995, pp 254–263.

  21. [21]

    Y. Matias andU. Vishkin, On Parallel Hashing and Integer Sorting.J. Algorithms 12 (1991), 573–606.

    Google Scholar 

  22. [22]

    J. B. Rosser andL. Schoenfeld, Approximate Formulas for Some Functions of Prime Numbers.Illinois J. Math. 6 (1962), 64–94.

    Google Scholar 

  23. [23]

    P. Ragde, The Parallel Simplicity of Compaction and Chaining.J. Algorithms 14 (1993), 371–380.

    Google Scholar 

  24. [24]

    L. Rudolph and W. Steiger, Subset Selection in Parallel. InProc. 1985 Int. Conf. Parallel Processing, IEEE Comput. Soc. Press, 1985, 11–14.

  25. [25]

    M. Snir, On Parallel Searching.SIAM J. Comput. 14 (1985), 688–708.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Fich, F., Kowaluk, M., Kutyłowski, M. et al. Retrieval of scattered information by EREW, CREW, and CRCW PRAMs. Comput Complexity 5, 113–131 (1995). https://doi.org/10.1007/BF01268141

Download citation

Subject classifications

  • 68Q22
  • 68Q25