Skip to main content
SpringerLink
Log in

σ-SSA and its construction through symbolic interpretation

  • Poster Session Papers
  • Conference paper
  • First Online:
Languages and Compilers for Parallel Computing (LCPC 1996)

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

  • 101 Accesses

Abstract

In this paper, we propose a new variant of SSA called σ-SSA and discuss its construction through symbolic interpretation of programs. By relaxing a condition of SSA form and without violating the fundamental property of static single assignment representation, σ-SSA form results in fewer join functions than the minimal SSA form.

A more detailed report can be found in [6].

This work is supported in part by the Office of Naval Research (ONR) under Grant No. N-00014-94-1-0234, and a grant from Intel Corporation.

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

References

  1. Jong-Deok Choi, Ron Cytron, and Jeanne Ferrante. Automatic construction of sparse data flow evaluation graphs. In Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages, pages 55–66, June 1991.

    Google Scholar 

  2. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM transactions on Programming Languages and Systems, 13(4):451–490, October 1991.

    Article  Google Scholar 

  3. Mohammad R. Haghighat. Symbolic Analysis for Parallelizing Compilers. PhD thesis, University of Illinois at Urbana-Champaign, 1994. Also available as a CSRD Technical Report.

    Google Scholar 

  4. Mohammad R. Haghighat. Symbolic Analysis for Parallelizing Compilers. Kluwer Academic Publishers, 1995.

    Google Scholar 

  5. Constantine D. Polychronopoulos, Milind Girkar, Mohammad Reza Haghighat, Chia Ling Lee, Bruce Leung, and Dale Schouten. Parafrase-2: An environment for parallelizing, partitioning, synchronizing, and scheduling programs on multiprocessors. International journal of High Speed Computing, 1(1):45–72, 1989.

    Article  Google Scholar 

  6. Hideki Saito and Constantine D. Polychronopoulos. σ-SSA and its construction through symbolic interpretation. Technical Report 1494, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, May 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 1308 W. Main St., 61801, Urbana, IL, USA

    Hideki Saito & Constantine D. Polychronopoulos

Authors
  1. Hideki Saito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Constantine D. Polychronopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Sehr Utpal Banerjee David Gelernter Alex Nicolau David Padua

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saito, H., Polychronopoulos, C.D. (1997). σ-SSA and its construction through symbolic interpretation. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1996. Lecture Notes in Computer Science, vol 1239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017277

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63091-3

  • Online ISBN: 978-3-540-69128-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation