Skip to main content
SpringerLink
Log in
Book cover

Conference on Functional Programming Languages and Computer Architecture

FPCA 1985: Functional Programming Languages and Computer Architecture pp 17–34Cite as

Data flow graph optimization in if1

  • Conference paper
  • First Online:

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

Abstract

Optimization techniques are as important when compiling data flow languages as when compiling conventional languages. This paper describes work that has been done on optimizers for SISAL programs that have been translated into IF1 data flow graphs. It shows that conventional optimization algorithms can be easily and efficiently implemented for data flow graphs, and that the payoff for even simple optimizations can be significant.

This work was supported (in part) by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, by Lawrence Livermore National Laboratory under contract No. W-7405-Eng-48.

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.

11. References

  1. Ackerman, W.B. and J.B. Dennis, "VAL-A value-oriented algorithmic language: Preliminary Reference Manual", Tech. Report TR-218, Computation Structures Group, Laboratory for Computer Science, MIT, Cambridge, MA, June 1979.

    Google Scholar 

  2. Aho, A.V. and J.D. Ullman, Principles of Compiler Design, Addison-Wesley, 1977.

    Google Scholar 

  3. Arvind, K.P. Gostelow, and W. Plouffe, "An Asynchronous Programming Language and Computing Machine", Tech. Report TR114a, Department of Information and Computer Science, University of California, Irvine, December 1978.

    Google Scholar 

  4. Barrett, W.A. and J.D. Couch, Compiler Construction: Theory and Practice, Science Research Associates, 1979.

    Google Scholar 

  5. McGraw, J.R., S.K. Skedzielewski, "Streams and Iteration in VAL: Additions to a Data Flow Language", Proc. of the Third International Conference on Distributed Computing Systems, pp. 730–739, Miami/Ft. Lauderdale, Florida, March 1982, IEEE order number CH-18028.

    Google Scholar 

  6. McGraw, J.R., S. Skedzielewski, S. Allan, R. Oldehoeft, J. Glauert, C. Kirkham, W. Noyce, and R. Thomas, "SISAL: Streams and Iteration in a Single-Assignment Language", Language Reference Manual, Version 1.2, M-146, Lawrence Livermore National Laboratory, Livermore, CA, March 1985.

    Google Scholar 

  7. Skedzielewski, S.K., and J.R.W. Glauert, "IF1, an Intermediate Form for Applicative Languages", Reference Manual, M-170, Lawrence Livermore National Laboratory, Livermore, CA, July 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Research Group, Lawrence Livermore National Laboratory, 94550, Livermore, California

    S. K. Skedzielewski & M. L. Welcome

Authors
  1. S. K. Skedzielewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. L. Welcome
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Pierre Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skedzielewski, S.K., Welcome, M.L. (1985). Data flow graph optimization in if1. In: Jouannaud, JP. (eds) Functional Programming Languages and Computer Architecture. FPCA 1985. Lecture Notes in Computer Science, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15975-4_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-15975-4_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation