Advertisement

Uniform circuits and exclusive read PRAMs

  • Inga Niepel
  • Peter Rossmanith
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 560)

Abstract

CRCW-PRAMs were characterized in terms of unbounded fan-in circuits. The idea of unambiguous circuits lead to a characterization of CREW-PRAMs. In this paper circuits are considered which consist of OR and NOT gates and additionally of gates that compute the cartesian product. These circuits are equivalent to traditional circuits composed of OR, AND, and NOT gates. However, if fan-out is bounded this is no longer true. If this concept is combined with the concept of unambiguity of circuits, the resulting circuits exactly characterize EREW-PRAMs. This solves an open question posed by Stockmeyer and Vishkin [22]. Furthermore, all other memory access restrictions of PRAMs are shown to have a characterization in terms of circuits with gates of type OR, NOT, and cartesian product.

Keywords

Memory Cell Global Memory Program Line Random Access Machine Parallel Random Access Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. K. Chandra, L. J. Stockmeyer, and U. Vishkin. A complexity theory for unbounded fan-in parallelism. In Proc. of 23rd IEEE Symposium on Foundations of Computer Science, pages 1–13, 1982.Google Scholar
  2. [2]
    S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2–22, 1985.CrossRefGoogle Scholar
  3. [3]
    P. Dymond and W. L. Ruzzo. Parallel RAMs with owned global memory and deterministic language recognition. In Proc. of 13th International Colloquium on Automata, Languages and Programming, number 226 in Lecture Notes in Computer Science, pages 95–104. Springer, 1986.Google Scholar
  4. [4]
    D. Eppstein and Z. Galil. Parallel algorithmic techniques for combinatorial computation. Ann. Rev. Comput. Sci., 3:233–283, 1988.CrossRefGoogle Scholar
  5. [5]
    F. E. Fich, P. Ragde, and A. Wigderson. Relationships between concurrent write models of parallel computation. In Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing, pages 179–189, 1984.Google Scholar
  6. [6]
    S. Fortune and J. Willie. Parallelism in random access machines. In Proc. of 10th ACM Symposium on Theory of Computing, pages 114–118, 1978.Google Scholar
  7. [7]
    A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1989.Google Scholar
  8. [8]
    L. M. Goldschlager. A universal interconnection pattern for parallel computers. Journal of the ACM, 29(3):1073–1086, 1982.CrossRefGoogle Scholar
  9. [9]
    T. Hagerup. Optimal parallel algorithms on planar graphs. Information and Computation, 84:71–96, 1990.CrossRefGoogle Scholar
  10. [10]
    J. Hastad. Almost optimal lower bounds for small depth circuits. In Proc. of 18th ACM Symposium on Theory of Computing, pages 6–20, May 1986.Google Scholar
  11. [11]
    H. J. Hoover, M. M. Klawe, and N. J. Pippenger. Bounding fan-out in logical networks. Journal of the ACM, 31:13–18, 1984.CrossRefGoogle Scholar
  12. [12]
    R. M. Karp and V. Ramachandran. A survey of parallel algorithms for sharedmemory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 17, pages 869–932. Elsevier, 1990.Google Scholar
  13. [13]
    K.-J. Lange. Unambiguity of circuits. In Proc. of 5th Conference on Structure in Complexity Theory, pages 130–137, 1990. (to appear in TCS).Google Scholar
  14. [14]
    K.-J. Lange and P. Rossmanith. Characterizing unambiguous augmented pushdown automata by circuits. In Proc. of 15th Symposium on Mathematical Foundations of Computer Science, number 452 in Lecture Notes in Computer Science, pages 399–406. Springer, 1990.Google Scholar
  15. [15]
    I. Niepel and P. Rossmanith. Uniform Circuits and Exclusive Read PRAMs. SFB-Bericht 342/31/90 A, 19055, Institut für Informatik, Technische Universität München, December 1990.Google Scholar
  16. [16]
    I. Parberry. Parallel Complexity Theory. Pitman, 1987.Google Scholar
  17. [17]
    P. Rossmanith. The owner concept for PRAMs. In Proc. of 8th Symposium on Theoretical Aspects of Computer Science, number 480 in Lecture Notes in Computer Science, pages 172–183. Springer, 1991.Google Scholar
  18. [18]
    W. L. Ruzzo. Tree-size bounded alternation. Journal of Computer and System Sciences, 21:218–235, 1980.CrossRefGoogle Scholar
  19. [19]
    W. L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365–383, 1981.CrossRefGoogle Scholar
  20. [20]
    J. T. Schwarz. Ultracomputers. ACM TOPLAS, 2(4):484–521, 1980.CrossRefGoogle Scholar
  21. [21]
    M. Snir. On parallel searching. In Proc. SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 242–253, Ottawa, Canada, 1982.Google Scholar
  22. [22]
    L. Stockmeyer and U. Vishldn. Simulation of parallel random access machines by circuits. SIAM Journal on Computing, 13(2):409–422, May 1984.CrossRefGoogle Scholar
  23. [23]
    U. Vishkin. Implementation of simultaneous memory address access in models that forbid it. Journal of Algorithms, 4:45–50, 1983.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Inga Niepel
    • 1
  • Peter Rossmanith
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2

Personalised recommendations