Dependence graphs and compiler optimizations

D. J. Kuck, R. H. Kuhn, David 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

Dependence graphs and compiler optimizations. / Kuck, D. J.; Kuhn, R. H.; Padua, David A; Leasure, B.; Wolfe, M.

Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981. Association for Computing Machinery, 1981. p. 207-218 (Conference Record of the Annual ACM Symposium on Principles of Programming Languages).

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

Kuck, DJ, Kuhn, RH, Padua, DA, 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. Conference Record of the Annual ACM Symposium on Principles of Programming Languages, Association for Computing Machinery, pp. 207-218, 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981, Williamsburg, United States, 1/26/81. https://doi.org/10.1145/567532.567555
Kuck DJ, Kuhn RH, Padua DA, Leasure B, Wolfe M. Dependence graphs and compiler optimizations. In Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981. Association for Computing Machinery. 1981. p. 207-218. (Conference Record of the Annual ACM Symposium on Principles of Programming Languages). https://doi.org/10.1145/567532.567555
Kuck, D. J. ; Kuhn, R. H. ; Padua, David A ; Leasure, B. ; Wolfe, M. / Dependence graphs and compiler optimizations. Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981. Association for Computing Machinery, 1981. pp. 207-218 (Conference Record of the Annual ACM Symposium on Principles of Programming Languages).
@inproceedings{fec221661afb4052b8c8e432ddc46979,
title = "Dependence graphs and compiler optimizations",
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.",
author = "Kuck, {D. J.} and Kuhn, {R. H.} and Padua, {David A} and B. Leasure and M. Wolfe",
year = "1981",
month = "1",
day = "26",
doi = "10.1145/567532.567555",
language = "English (US)",
isbn = "089791029X",
series = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",
publisher = "Association for Computing Machinery",
pages = "207--218",
booktitle = "Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981",

}

TY - GEN

T1 - Dependence graphs and compiler optimizations

AU - Kuck, D. J.

AU - Kuhn, R. H.

AU - Padua, David A

AU - Leasure, B.

AU - Wolfe, M.

PY - 1981/1/26

Y1 - 1981/1/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85027612984&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027612984&partnerID=8YFLogxK

U2 - 10.1145/567532.567555

DO - 10.1145/567532.567555

M3 - Conference contribution

AN - SCOPUS:85027612984

SN - 089791029X

T3 - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

SP - 207

EP - 218

BT - Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981

PB - Association for Computing Machinery

ER -