Skip to main content
SpringerLink
Log in

Semi-automatic parallelization of fortran programs

  • System Software & Programming Language Aspects (Session 4.1)
  • Conference paper
  • First Online:
CONPAR 86 (CONPAR 1986)

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

Included in the following conference series:

Abstract

In this paper we describe the design of an interactive, knowledge-based system for the semi-automatic transformation of Fortran 77 programs into parallel programs for a new supercomputer. The system is characterized by a powerful analysis component, a catalog of MIMD and SIMD transformations, and a flexible dialog facility. It contains specific knowledge about the parallelization of an important class of numerical algorithms.

The work described in this paper is being performed within the German Supercomputer project SUPRENUM and is supported by the Federal Ministry for Research and Technology (BMFT), F.R. Germany

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. Adams, L. M., Voigt, R. G.: A Methodology for Exploiting Parallelism in the Finite Element Process In: Kowalik, J. S. (Ed.): High-Speed Computation, NATO ASI Series, 373–392, Springer Verlag (1984)

    Google Scholar 

  2. Aho, A. V., Sethi, R., Ullman, J. D.: Compilers. Principles, Techniques, and Tools Addison-Wesley (1986)

    Google Scholar 

  3. Allen, J. R., Kennedy, K.: PFC: A Program to Convert Fortran to Parallel Form Proc. IBM Conf. Parallel Comp. and Scientific Computations (1982)

    Google Scholar 

  4. American National Standards Institute X3J3: Fortran 8X Version 98 (Jan 1986)

    Google Scholar 

  5. Arnold, C. N.: Performance Evaluation of Three Automatic Vectorization Packages Proc. 1979 Internat. Conf. Parallel Processing, 235–242 (1982)

    Google Scholar 

  6. Bernstein, A. J.: Analysis of Programs for Parallel Processing IEEE Trans. Electronic Computers EC-15, 757–762 (Oct 1966)

    Google Scholar 

  7. Cytron, R. G.: Compile-Time Scheduling and Optimization for Asynchronous Machines Ph. D. Dissertation, Dept. of Computer Science, University of Illinois at Urbana-Champaign (1984)

    Google Scholar 

  8. Flynn, M. J.: Some Computer Organizations and Their Effectiveness IEEE Trans. Computers, C-21, No. 9, 948–960 (Sep 1972)

    Google Scholar 

  9. Hecht, M. S.: Flow Analysis of Computer Programs North Holland (1977)

    Google Scholar 

  10. Holter, W. H.: A Vectorized Multigrid Solver for the Three-Dimensional Poisson Equation In: Emmen, A. H. L. (Ed.): Supercomputer Applications, Elsevier (1985)

    Google Scholar 

  11. Kam, J. B., Ullman, J. D.: Global Data Flow Analysis and Iterative Algorithms Journal ACM 23, 158–171 (1976)

    Google Scholar 

  12. Kildall, G. A.: A Unified Approach to Global Program Optimization Conf. Rec. ACM Symp. on Principles of Prog. Lang., 194–206 (1973)

    Google Scholar 

  13. Kuck, D. J., Kuhn, R. H., Leasure, B., Wolfe, M.: The Structure of an Advanced Retargetable Vectorizer Proc. COMPSAC '80 (1980)

    Google Scholar 

  14. Muchnick, S. S., Jones, N. D. (Eds.): Program Flow Analysis. Theory and Applications Prentice Hall (1981)

    Google Scholar 

  15. Mühlenbein, H., Warhaut, S.: Concurrent Multigrid Methods in an Object-Oriented Environment — A Case Study Proc. 1985 Internat. Conf. Parallel Processing, 143–146 (Aug 1985)

    Google Scholar 

  16. Ramamoorthy, C. V., Gonzalez, M. J.: A Survey of Techniques for Recognizing Parallel Processable Streams in Computer Programs In: Proc. AFIPS 1969 Fall Joint Comp. Conf., 1–15 (1969)

    Google Scholar 

  17. Russell, E. C.: Automatic Program Analysis Ph. D. Dissertation, Dept. of Electrical Engineering, University of California, Los Angeles, California (1969)

    Google Scholar 

  18. Stüben, K., Trottenberg, U.: Multigrid Methods: Fundamental Algorithms, Model Problem Analysis and Applications Proc. Conf. Multigrid Methods, Lecture Notes in Mathematics, Vol. 960, Springer Verlag (1982)

    Google Scholar 

  19. Zima, H.: Compilerbau I: Analyse Reihe Informatik Band 36, Bibliographisches Institut (1982)

    Google Scholar 

  20. Zima, H.: Compilerbau II: Synthese und Optimierung Reihe Informatik Band 37, Bibliographisches Institut (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Bonn Institut für Informatik III, Bertha-von-Suttner-Platz 6, D-5300, Bonn 1, Federal Republic of Germany

    Hans P. Zima, Heinz-J. Bast, Michael Gerndt & Peter J. Hoppen

Authors
  1. Hans P. Zima
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heinz-J. Bast
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Gerndt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peter J. Hoppen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Händler Dieter Haupt Rolf Jeltsch Wilfried Juling Otto Lange

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zima, H.P., Bast, HJ., Gerndt, M., Hoppen, P.J. (1986). Semi-automatic parallelization of fortran programs. In: Händler, W., Haupt, D., Jeltsch, R., Juling, W., Lange, O. (eds) CONPAR 86. CONPAR 1986. Lecture Notes in Computer Science, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16811-7_182

Download citation

  • DOI: https://doi.org/10.1007/3-540-16811-7_182

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16811-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation