Skip to main content
SpringerLink
Log in
Book cover

International Conference of the Austrian Center for Parallel Computation

ACPC 1993: Parallel Computation pp 182–193Cite as

Parallelization — A case study

  • Conference paper
  • First Online:

  • 117 Accesses

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

Abstract

Parallelization of non-regular organised algorithms has turned out to be a very complicated task. Due to the hierarchical structure of context-free languages compiling is an illustrative example for these issues. Thus, the suggested technique may serve as an example for how to develop efficient parallel programs.

Starting from fundamental technical requirements of parallel computers, a list of essentials is compiled which every algorithm has to fulfil. Based on these demands, the concept of local parsability forms the theoretical base for a new approach on parallel parsing. Although the presented method applies only for a subclass of context-free languages it proved to be strong enough to handle nearly all programming languages.

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. E. Klein, K. Koskimies: The Parallelization of One-Pass-Compilers. GMD Sankt Augustin. Arbeitspapiere 416. 1989

    Google Scholar 

  2. L. Lundberg: A Parallel Ada System on an Experimental Multiprocessor. Softw.Pract.Exper. 8, 787–800 (1989)

    Google Scholar 

  3. L.A. Barford, B.T. van der Zanden: Attribute Grammars in Constraint-based Graphic Systems. Softw.Pract.Expr. 4, 309–328 (1989)

    Google Scholar 

  4. P. Rechenburg:Attributierte Grammatiken als Methode der Softwaretechnik. Elektr. Rechenanlagen 3, 111–118 (1984)

    Google Scholar 

  5. B. Alpern, T. Reps: Interactive Proof Checking. In ACM Attributierte Grammatiken als Methode der Softwaretechnik Symp. on Principles of Programming Languages. 1984.

    Google Scholar 

  6. J. Lampe: Zur parallelen Verarbeitung formal definierter Sprachen. Habilit. TU Dresden 1991

    Google Scholar 

  7. J. Lampe: Local Parse — A Base for Realistic Parallelization of Compilers. J. Inf. Process. Cybern. EIK 1/2,75–84 (1990)

    Google Scholar 

  8. R.o.d. Akker et al:. An Annotated Bibliography on Parallel Parsing. Enschede: University of Twente. Mem. Informatica 89–67. 1989

    Google Scholar 

  9. D.B. Skillicorn, D.T. Barnard: A Survey of Parallel Compilation. Kingston (Canada): Queen's University, Dept. of Computing and Information Science, Sept. 12, 1990

    Google Scholar 

  10. M.F. Kuiper, A. Dijkstra: Attribute evaluation on a network of transputers. In J. Wexler (ed.): Developing Transputer Applications. Amsterdam: 1989, 142–149

    Google Scholar 

  11. J. Lampe: Ein Lokalitätskonzept für die parallele Sprachverarbeitung mit Attributgrammatiken. Wiss. Z. Techn. Univers. Dresden 4, 57–60 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, TU Dresden, Mommsenstr.13, D-01062, Dresden

    Jürgen Lampe

Authors
  1. Jürgen Lampe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lampe, J. (1993). Parallelization — A case study. In: Volkert, J. (eds) Parallel Computation. ACPC 1993. Lecture Notes in Computer Science, vol 734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57314-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-57314-3_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation