Advertisement

Algorithmica

, 6:479 | Cite as

Large parallel machines can be extremely slow for small problems

  • Vince Grolmusz
Article
  • 54 Downloads

Abstract

We consider concurrent-write PRAMs with a large number of processors of unlimited computational power and an infinite shared memory. Our adversary chooses a small number of our processors and gives them a 0–1 input sequence (each chosen processor gets a bit, and each bit is given to one processor). The chosen processors are required to compute thePARITY of their input, while the others do not take part in the computation. Ifat most q processors are chosen andq ≤1/2 log logn, then we show that computing PARITY needsq steps in the worst case. On the other hand, there exists an algorithm which computes PARITY inq steps (for anyq <n) in this model, thus our result is sharp. Surprisingly, if our adversary choosesexactly q of our processors, then they can compute PARITY in [q/2] + 2 steps, and in this case we show that it needs at least [q2] steps. Our result implies that large parallel machines which are efficient when only a small number of their processors are active cannot be constructed. On the other hand, a result of Ajtai and Ben-Or [1] shows that if we haven input bits which contain at most polylogn 1's and polynomially many processors which are all allowed to work, then thePARITY can be solved inconstant time.

Key words

Parallel computation Lower bounds Fault tolerant computation 

References

  1. [1]
    Ajtai, M., Ben-Or, M.: A Theorem on Probabilistic Constant Depth Computation,Proc. 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 471–474.Google Scholar
  2. [2]
    Beame, P.: Lower Bounds in Parallel Machine Computation, Ph.D. Thesis, University of Toronto, 1986.Google Scholar
  3. [3]
    Beame, P., Hastad, J.: Optimal Bounds for Decision Problems on the CRC W PRAM,Proc. 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 83–93.Google Scholar
  4. [4]
    Chlebus, B. S., Diks, K., Hagerup, T., Radzik T.: Efficient Simulations Between Concurrent-Write PRAM Models,Proc. 13th Symposium on the Mathematical Foundations of Computer Science, 1988, pp. 230–239.Google Scholar
  5. [5]
    Cook, S. A., Dwork, C., Reischuk, R.: Upper and Lower Bounds for Parallel Random Access Machines Without Simultaneous Writes,SIAM Journal on Computing, vol. 15, no. 1, 1986, pp. 87–97.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    Fich, F. E., Meyer auf der Heide, F., Wigderson, A.: One, Two, Three,..., Infinity: Lower Bounds for Parallel Computation,Proc. 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 48–58.Google Scholar
  7. [7]
    Fich, F. E., Ragde, P., Wigderson, A.: Simultaneous Among Concurrent-Write PRAMs,Algorithmica, vol. 3, no. 1, 1988, pp. 43–52.MATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    Furst, M., Saxe, J. B., Sipser, M.: Parity, Circuits, and the Polynomial Time Hierarchy,Mathematical Systems Theory, vol. 17, 1984, pp. 13–27.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    Goldschlager, L.: A Unified Approach to Models of Synchronous Parallel Machines,Journal of the Association for Computing Machinery, vol. 29, no. 4, 1982, pp. 1073–1086.MATHMathSciNetGoogle Scholar
  10. [10]
    Grolmusz, V.: On the Complexity of Parallel Algorithms, Ph.D Thesis, Eötvös University, Hungarian Academy of Sciences, 1988 (in Hungarian).Google Scholar
  11. [II]
    Grolmusz, V., Ragde, P.: Incomparability in Parallel Computation,Proc. 27th Annual IEEE Symposium on Foundations of Computer Science, 1987, pp. 89–98.Google Scholar
  12. [12]
    Hastad, J.: Almost Optimal Lower Bounds for Small Depth Circuits,Proc. 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 6–20.Google Scholar
  13. [13]
    Kučera, L.: Parallel Computation and Conflicts in Memory Access,Information Processing Letters, vol. 14, no. 2, 1982, pp. 93–96.MATHMathSciNetCrossRefGoogle Scholar
  14. [14]
    Meyer auf der Heide, F., Wigderson, A.: The Complexity of Parallel Sorting,SIAM Journal of Computing, vol. 16, 1987, pp. 100–108.MATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    Ragde, P., Steiger, W., Szemerédi, E., Wigderson, A.: The Parallel Complexity of Element Distinctness in ω(√logn),SIAM Journal of Discrete Mathematics, vol. 1, no. 3, 1988, pp. 399–410.MATHCrossRefGoogle Scholar
  16. [16]
    Stockmeyer, L., Vishkin, U.: Simulation of Parallel Random Access Machines by Circuits,SIAM Journal on Computing, vol. 13, no. 2, 1984, pp. 409–422.MATHCrossRefMathSciNetGoogle Scholar
  17. [17]
    Yao, A.: Separating the Polynomial-Time Hierarchy by Oracles.Proc. 25th Annual IEEE Symposium on Foundations of Computer Science, 1985 pp. 1–10.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1991

Authors and Affiliations

  • Vince Grolmusz
    • 1
  1. 1.Department of Computer ScienceEötvös UniversityBudapestHungary

Personalised recommendations