• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Efficiently computing static single assignment form and the control dependence graph (1991)

Cached

  • Download as a PDF

Download Links

  • [grothoff.org]
  • [www.eecs.umich.edu]
  • [www.cs.purdue.edu]
  • [www.math.tau.ac.il]
  • [www.cs.colorado.edu]
  • [www.cs.utsa.edu]
  • [sol.cs.trinity.edu]
  • [www.cs.trinity.edu]
  • [www-plan.cs.colorado.edu]
  • [sol.cs.trinity.edu]
  • [rsim.cs.illinois.edu]
  • [www.cs.cmu.edu]
  • [www.cs.purdue.edu]
  • [www.cse.unsw.edu.au]
  • [www.cs.utexas.edu]
  • [www.cse.iitb.ac.in]
  • [ldc.usb.ve]
  • [www.cs.uiuc.edu]
  • [cist.buct.edu.cn]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Ron Cytron , Jeanne Ferrante , Barry K. Rosen , Mark N. Wegman , F. Kenneth Zadeck
Venue:ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
Citations:1002 - 8 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Cytron91efficientlycomputing,
    author = {Ron Cytron and Jeanne Ferrante and Barry K. Rosen and Mark N. Wegman and F. Kenneth Zadeck},
    title = {Efficiently computing static single assignment form and the control dependence graph},
    journal = {ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS},
    year = {1991},
    volume = {13},
    pages = {451--490}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive, the difficulty of their construction and their potential size have discouraged their use. We present new algorithms that efficiently compute these data structures for arbitrary control flow graphs. The algorithms use dominance frontiers, a new concept that may have other applications. We also give analytical and experimental evidence that all of these data structures are usually linear in the size of the original program. This paper thus presents strong evidence that these structures can be of practical use in optimization.

Keyphrases

control dependence graph    static single assignment form    data structure    optimization feature    present new algorithm    experimental evidence    practical use    useful class    potential size    new concept    poor choice    program optimization    original program    practical program optimization    strong evidence    algorithm use dominance frontier    control flow propertiee    data structure choice    arbitrary control flow graph    data flow    unrelated technique   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University