Retrieval of scattered information by EREW, CREW and CRCW PRAMs

  • Faith Fich
  • Miroslaw Kowaluk
  • Krzysztof Loryś
  • Miroslaw Kutylowski
  • Prabhakar Ragde
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 621)

Abstract

The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algorithms for k-compaction have obvious applications in processor allocation and load balancing; k-compaction is also an important subroutine in many recently developed parallel algorithms. We show that any EREW PRAM that solves the k-compaction problem requires Ω(√log n) time, even if the number of processors is arbitrarily large and k=2. On the CREW PRAM, we show that every n-processor algorithm for k-compaction problem requires Ω(loglog n) time, even if k=2. Finally, we show that O(log k) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H. Bast and T. Hagerup: Fast and Reliable Parallel Hashing. In: Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 50–61.Google Scholar
  2. [2]
    P. Beame, M. Kik and M. Kutyłowski: Information broadcasting by Exclusive Read PRAMs. Manuscript.Google Scholar
  3. [3]
    C. Berge: Graphs and Hypergraphs. North-Holland, Amsterdam, 1976.Google Scholar
  4. [4]
    R. Cole: Parallel Merge Sort. SIAM J. Comput. 17, 1988, pp. 770–785.Google Scholar
  5. [5]
    S. Cook, C. Dwork and R. Reischuk: Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes. SIAM J. Comput. 15, 1986, pp. 87–97.Google Scholar
  6. [6]
    M. Dietzfelbinger, M. Kutylowski and R. Reischuk: Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. To appear in J. Computer and System Sciences.Google Scholar
  7. [7]
    F. E. Fich, R. Impagliazzo, B. Kapron, V. King and M. Kutylowski: Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. Manuscript.Google Scholar
  8. [8]
    F. E. Fich, P. Ragde, A. Wigderson: Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17, 1988, pp. 606–627.Google Scholar
  9. [9]
    J. Gil and Y. Matias: Fast Hashing on a PRAM — Designing by Expectation. In: Proc. 2nd Annual ACM Symposium on Discrete Algorithms, 1991, pp. 271–280.Google Scholar
  10. [10]
    J. Gil, Y. Matias, and U. Vishkin: Towards a Theory of Nearly Constant Parallel Time Algorithms. In: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 698–710.Google Scholar
  11. [11]
    J. Gil and L. Rudolph: Counting and Packing in Parallel. In: Proc. 1986 International Conference on Parallel Processing, pp. 1000–1002.Google Scholar
  12. [12]
    M. Goodrich: Using Approximation Algorithms to Design Parallel Algorithms that may Ignore Processor Allocation. In: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 711–722.Google Scholar
  13. [13]
    T. Hagerup. Personal communicationGoogle Scholar
  14. [14]
    T. Hagerup: Fast and Optimal Simulations between CRCW PRAMs. In: Proc. 9th Symposium on Theoretical Aspects of Computer Science, 1992, pp. 45–56.Google Scholar
  15. [15]
    T. Hagerup: The Log-Star Revolution. In: Proc. 9th Symposium on Theoretical Aspects of Computer Science, 1992, pp. 259–280.Google Scholar
  16. [16]
    T. Hagerup and M. Nowak: Parallel retrieval of scattered information. In: Proc. 16th International Colloquium on Automata, Languages, and Programming, 1989, pp. 439–450.Google Scholar
  17. [17]
    T. Hagerup and T. Radzik: Every ROBUST CRCW PRAM can Efficiently Simulate a PRIORITY PRAM. In: Proc. 2nd ACM Symposium on Parallel Algorithms and Architectures, 1990, pp. 125–135.Google Scholar
  18. [18]
    Y. Matias and U. Vishkin: On Parallel Hashing and Integer Sorting. In: Proc. 18th International Colloquium on Automata, Languages, and Programming, 1991, pp. 729–743.Google Scholar
  19. [19]
    J. B. Rosser and L. Schoenfeld: Approximate Formulas for Some Functions of Prime Numbers. Illinois J. Math. 6, 1962, pp. 64–94.Google Scholar
  20. [20]
    P. Ragde: The Parallel Simplicity of Compaction and Chaining. In: Proc. 17th International Colloquium on Automata, Languages, and Programming, 1990, pp. 744–751.Google Scholar
  21. [21]
    L. Rudolph and W. Steiger: Subset Selection in Parallel. In: Proc. 1985 International Conference on Parallel Processing, pp. 11–14.Google Scholar
  22. [22]
    M. Snir: On parallel searching. SIAM J. Comput. 14, 1985, pp. 688–708.Google Scholar

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • Faith Fich
    • 1
    • 2
  • Miroslaw Kowaluk
    • 3
  • Krzysztof Loryś
    • 3
  • Miroslaw Kutylowski
    • 4
  • Prabhakar Ragde
    • 5
  1. 1.University of TorontoTorontoCanada
  2. 2.MITCambridgeUSA
  3. 3.Universität WürzburgWürzburgGermany
  4. 4.FB Informatik and Heinz-Nixdorf-InstitutUniversität-GH PaderbornPaderbornGermany
  5. 5.University of WaterlooWaterlooCanada

Personalised recommendations