Optimal parallel recognition of bracket languages on hypercubes | SpringerLink
Skip to main content
Springer Nature Link
Log in

Optimal parallel recognition of bracket languages on hypercubes

  • Parallel Algorithms
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

Abstract

Bracket languages play an important role in the syntax analysis of programming languages. We investigate the parallel recognition and analysis of these languages as a first step towards a parallelly working compiler. The main result consists in the design of an appropriate algorithm, which can be executed on hypercubes as well as on related networks with bounded degree. In the average case we can achieve an optimal speed-up, i.e. that q processors can together analyse bracket words of length N in time O(N/q), if we restrict ourselves to employing no more than \(\sqrt N\) processors.

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. I. Bar-On, U. Vishkin: Optimal Parallel Generation of a Computation Tree Form. ACM, Trans. Prog. Lang. and Syst. Vol. 7, No. 2, April 1985, pp. 348–357.

    Google Scholar 

  2. Batcher: Sorting Networks and their Applications. AFIPS Spring Joint Comp. Conf. 32 (1968), pp. 307–314.

    Google Scholar 

  3. R. Cypher, J.L.C. Sanz: Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers. LNCS 319, pp. 456–464.

    Google Scholar 

  4. M.J. Fischer, R.E. Ladner: Parallel Prefix Computation. J. Ass. Comp. Mach., Vol. 27, 1980, pp. 839–849.

    Google Scholar 

  5. G. Hotz, K. Estenfeld: Formale Sprachen. Bibliographisches Institut (1981).

    Google Scholar 

  6. G. Hotz, J. Messerschmidt: Dycksprachen sind in Bandkomplexität log n analysierbar. Techn. Rep. A75/1, Universität des Saarlandes, 1975.

    Google Scholar 

  7. R. Kemp: Fundamentals of the Average Case Analysis of Particular Algorithms. Wiley-Teubner (1984), chapter 5.

    Google Scholar 

  8. T. Leighton: Tight Bounds on the Complexity of Parallel Sorting. IEEE Trans. on computers, Vol. C34, 4, April 1985, pp. 344–354.

    Google Scholar 

  9. D. Nassimi, S. Sahni: Data Broadcasting in SIMD Computers. IEEE Trans. on computers, Vol. C30, 2, Feb. 1981, pp. 101–107.

    Google Scholar 

  10. G. Pitsch: Effiziente parallele Verfahren zur Entscheidung des Wortproblems bei Dycksprachen. Master's Thesis, Universität des Saarlandes, Saarbrücken, 1989.

    Google Scholar 

  11. F. Preparata, J. Vuillemin: The Cube-Connected Cycles: A versatile network for parallel computation. 20th FOCS (1979), pp. 140–147.

    Google Scholar 

  12. J. Reif: Parallel time O(log n) acceptance of deterministic cfl's. 23rd FOCS (1982).

    Google Scholar 

  13. W. Rytter, K. Diks: On optimal parallel computations for sequences of brackets. Workshop “Sequences”, Positano, June 1988.

    Google Scholar 

  14. W. Rytter, R. Giancarlo: Optimal parallel parsing of bracket languages. Theoretical Computer Science 53 (1987), pp. 295–306.

    Article  Google Scholar 

  15. H. S. Stone: Parallel processing with the perfect shuffle. IEEE Trans. on computers, Vol. C20, 2, February 1971, pp. 153–161.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl Prof. G. Hotz Fachbereich 14 — Informatik, Universität des Saarlandes, D-6600, Saarbrücken, West Germany

    Gisela Pitsch & Elmar Schömer

Authors
  1. Gisela Pitsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elmar Schömer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pitsch, G., Schömer, E. (1991). Optimal parallel recognition of bracket languages on hypercubes. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020818

Download citation

  • DOI: https://doi.org/10.1007/BFb0020818

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation