Dependence graphs and compiler optimizations

D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, M. Wolfe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Dependence graphs can be used as a vehicle for formulating and implementing compiler optimizations. This paper defines such graphs and discusses two kinds of transformations. The first are simple rewriting transformations that remove dependence arcs. The second are abstraction transformations that deal more globally with a dependence graph. These transformations have been implemented and applied to several different types of high-speed architectures.

Original languageEnglish (US)
Title of host publicationProceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981
PublisherAssociation for Computing Machinery
Pages207-218
Number of pages12
ISBN (Print)089791029X
DOIs
StatePublished - Jan 26 1981
Event8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981 - Williamsburg, United States
Duration: Jan 26 1981Jan 28 1981

Publication series

NameConference Record of the Annual ACM Symposium on Principles of Programming Languages
ISSN (Print)0730-8566

Other

Other8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981
CountryUnited States
CityWilliamsburg
Period1/26/811/28/81

ASJC Scopus subject areas

  • Software

Cite this

Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B., & Wolfe, M. (1981). Dependence graphs and compiler optimizations. In Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981 (pp. 207-218). (Conference Record of the Annual ACM Symposium on Principles of Programming Languages). Association for Computing Machinery. https://doi.org/10.1145/567532.567555