Skip to main content
SpringerLink
Log in

Efficient parallel evaluation of straight-line code and arithmetic circuits

  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 227))

Included in the following conference series:

Abstract

A new parallel algorithm is given to evaluate a straight line program. The algorithm evaluates a program over a commutative semi-ring R of degree d and size n in time O(log n(log nd)) using M(n) processors, where M(n) is the number of processors required for multiplying n×n matrices over the semi-ring R in O (log n) time.

Research supported in part by National Science Foundation Grant MCS-800756 A01.

Research supported by NSF under ECS-8404866, the Semiconductor Research Corporation under RSCH 84-06-049-6, and by an IBM Faculty Development Award.

Research Supported in part by NSF Grant DCR-8504391 and by an IBM Faculty Development Award

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

    Google Scholar 

  2. R.P. Brent. "The Parallel Evaluation of General Arithmetic Expressions". JACM 21, 2 (April 1974), 201–208.

    Google Scholar 

  3. S. A. Cook. Towards a Complexity Theory of Synchronous Parallel Computation. Internationales Symposium uber Logik und Algorithmik zu Enren von Professor Hort Specker,, February, 1980, pp.

    Google Scholar 

  4. D. Coppersmith, and S. Winograd. "On The Asymptotic Complexity of Matrix Multipication". SIAM J. Comput. 11, 3 (August 1982), 472–492.

    Google Scholar 

  5. R. E. Ladner. "The Circuit Value Problem Is Log Space Complete for P". SIGACT News 7, 1 (1975), 18–20.

    Google Scholar 

  6. G.L. Miller and J.H. Reif. Parallel Tree Contraction and Its Applications. 26th Symposium on Foundations of Computer Science, IEEE, Portland, Oregon, 1985, pp. 478–489.

    Google Scholar 

  7. L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. "Fast Parallel Computation of Polynomials Using Few Processors". SIAM J. Comput. 12, 4 (November 1983), 641–644.

    Google Scholar 

  8. L. G. Valiant, and S. Skyum. Lecture Notes in Computer Science. Volume 118: Fast Parallel Computation of Polynomials Using Few Processors. In, Springer-Verlag, New York, 1981, pp. 132–139.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Mathematical Sciences Research Institute and University of Southern California, 90089-0782, Los Angeles, CA

    Gary L Miller

  2. Coordinated Science Laboratory, Mathematical Sciences Research Institute and University of Illinois, 61801-3082, Urbana, IL

    Vijaya Ramachandran

  3. Computer Science Department, Mathematical Sciences Research Institute and Rensselaer Polytechnic Inst., 12181, Troy, NY

    Erich Kaltofen

Authors
  1. Gary L Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijaya Ramachandran
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erich Kaltofen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Filia Makedon Kurt Mehlhorn T. Papatheodorou P. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miller, G.L., Ramachandran, V., Kaltofen, E. (1986). Efficient parallel evaluation of straight-line code and arithmetic circuits. In: Makedon, F., Mehlhorn, K., Papatheodorou, T., Spirakis, P. (eds) VLSI Algorithms and Architectures. AWOC 1986. Lecture Notes in Computer Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16766-8_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-16766-8_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16766-2

  • Online ISBN: 978-3-540-38746-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation