Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1991: Foundations of Software Technology and Theoretical Computer Science pp 307–318Cite as

Uniform circuits and exclusive read PRAMs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

This research was partially supported by the Deutsche Forschungsgemeinschaft, SFB 342, Teilprojekt A4 “KLARA”

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. 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. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2–22, 1985.

    Article  Google Scholar 

  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. D. Eppstein and Z. Galil. Parallel algorithmic techniques for combinatorial computation. Ann. Rev. Comput. Sci., 3:233–283, 1988.

    Article  Google Scholar 

  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. 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. A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1989.

    Google Scholar 

  8. L. M. Goldschlager. A universal interconnection pattern for parallel computers. Journal of the ACM, 29(3):1073–1086, 1982.

    Article  Google Scholar 

  9. T. Hagerup. Optimal parallel algorithms on planar graphs. Information and Computation, 84:71–96, 1990.

    Article  Google Scholar 

  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. H. J. Hoover, M. M. Klawe, and N. J. Pippenger. Bounding fan-out in logical networks. Journal of the ACM, 31:13–18, 1984.

    Article  Google Scholar 

  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. 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. 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. 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. I. Parberry. Parallel Complexity Theory. Pitman, 1987.

    Google Scholar 

  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. W. L. Ruzzo. Tree-size bounded alternation. Journal of Computer and System Sciences, 21:218–235, 1980.

    Article  Google Scholar 

  19. W. L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365–383, 1981.

    Article  Google Scholar 

  20. J. T. Schwarz. Ultracomputers. ACM TOPLAS, 2(4):484–521, 1980.

    Article  Google Scholar 

  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. L. Stockmeyer and U. Vishldn. Simulation of parallel random access machines by circuits. SIAM Journal on Computing, 13(2):409–422, May 1984.

    Article  Google Scholar 

  23. U. Vishkin. Implementation of simultaneous memory address access in models that forbid it. Journal of Algorithms, 4:45–50, 1983.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstr. 21, D-8000, München 2

    Inga Niepel & Peter Rossmanith

Authors
  1. Inga Niepel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Rossmanith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Somenath Biswas Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niepel, I., Rossmanith, P. (1991). Uniform circuits and exclusive read PRAMs. In: Biswas, S., Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1991. Lecture Notes in Computer Science, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54967-6_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-54967-6_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54967-3

  • Online ISBN: 978-3-540-46612-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation