Skip to main content
SpringerLink
Log in

The Dynamic Tree Expression Problem

  • Chapter
Concurrent Computations

Abstract

We present a uniform method for obtaining efficient parallel algorithms for a rather large class of problems. The method is based on a logic programming model, and it derives its efficiency from fast parallel routines for the evaluation of expression trees.

This work was supported in part by a grant from the AT&T Foundation, ONR contract N00014-85-C-0731, and NSF grant DCR-8351757.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. J.ACM,28(1):114–133, 1981.

    Google Scholar 

  2. R. Cole. Parallel merge sort. In Proceedings of the 27th Ann. IEEE Symposium on Foundations of Computer Science (Toronto, Canada), pages 511–516, 1986.

    Google Scholar 

  3. P. Dymond. Simultaneous resource bounds and parallel computation. Ph.D. Thesis, Department of Computer Science, University of Toronto, 1980.

    Google Scholar 

  4. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proceedings of the 10th Ann. ACM Symposium on Theory of Computing (San Diego, CA), pages 114–118, 1978.

    Google Scholar 

  5. L. Goldschlager. The monotone and planar circuit value problems are log-space complete for P. SIGACT News, 9 (2): 25–29, 1977.

    Article  Google Scholar 

  6. L. Goldschlager. A space efficient algorithm for the monotone planar circuit value problem. Information Processing Letters, 10 (1): 25–27, 1980.

    Article  Google Scholar 

  7. P. Hochschild, E. Mayr, and A. Siegel. Techniques for solving graph problems in parallel environments. In Proceedings of the 24th Ann. IEEE Symposium on Foundations of Computer Science (Tucson, AZ), pages 351–359, 1983.

    Google Scholar 

  8. J. Hoperoft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  9. R. Ladner. The circuit value problem is log-space complete for P. SIGACT News, 7 (1): 583–590, 1975.

    Article  Google Scholar 

  10. R. Ladner and M. Fischer. Parallel prefix computation. J.ACM, 27 (4): 831–838, 1980.

    Article  Google Scholar 

  11. R. Lipton and J. Valdes. Census functions: An approach to VLSI upper bounds (preliminary version). In Proceedings of the 22nd Ann. IEEE Symposium on Foundations of Computer Science (Nashville, TN), pages 13–22, 1981.

    Google Scholar 

  12. E. Mayr and G. Plaxton. Network Implementations of the DTEP Algorithm. Technical Report STAN-CS-87–1157, Department of Computer Science, Stanford University, 1987.

    Google Scholar 

  13. G. Miller, V. Ramachandran, and E. Kaltofen. Efficient parallel evaluation of straight-line code and arithmetic circuits. Technical Report TR-86–211, Computer Science Dept., USC, 1986.

    Google Scholar 

  14. G. Miller and J. Reif. Parallel tree contraction and its application. In Proceedings of the 26th Ann. IEEE Symposium on Foundations of Computer Science (Portland, OR), pages 478–489, 1985.

    Google Scholar 

  15. G. Pfister. The architecture of the IBM research parallel processor prototype (RP3). Technical Report RC 11210 Computer Science, IBM Yorktown Heights, 1985.

    Google Scholar 

  16. N. Pippenger. On simultaneous resource bounds. In Proceedings of the 20th Ann. IEEE Symposium on Foundations of Computer Science (San Juan, PR), pages 307–311, 1979.

    Google Scholar 

  17. F. Preparata and J. Vuillemin. The cube-connected-cycles: A versatile network for parallel computation. In Proceedings of the 20th Ann. IEEE Symposium on Foundations of Computer Science (San Juan, PR), pages 140–147, 1979.

    Google Scholar 

  18. W. Ruzzo. Tree-size bounded alternation. In Proceedings of the 11th Ann. ACM Symposium on Theory of Computing (Atlanta, GA), pages 352–359, 1979.

    Google Scholar 

  19. J. Schwartz. Ultracomputers. ACM Transactions on Programming Languages and Systems, 2 (4): 484–521, 1980.

    Article  Google Scholar 

  20. C. Seitz. The cosmic cube. CACM, 28 (1): 22–33, 1985.

    Google Scholar 

  21. J. Ullman and A. van Gelder. Parallel complexity of logical query programs In Proceedings of the 27th Ann. IEEE Symposium on Foundations of Computer Science (Toronto, Canada), pages 438–454, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, Stanford, CA, USA

    Ernst W. Mayr

Authors
  1. Ernst W. Mayr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Bell Laboratories, Holmdel, New Jersey, USA

    Stuart K. Tewksbury

  2. Princeton University, Princeton, New Jersey, USA

    Bradley W. Dickinson  & Stuart C. Schwartz  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Plenum Press, New York

About this chapter

Cite this chapter

Mayr, E.W. (1988). The Dynamic Tree Expression Problem. In: Tewksbury, S.K., Dickinson, B.W., Schwartz, S.C. (eds) Concurrent Computations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5511-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-5511-3_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-5513-7

  • Online ISBN: 978-1-4684-5511-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation