Article

Free access

Dependence graphs and compiler optimizations

Authors:

M. WolfeAuthors Info & Claims

POPL '81: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 207 - 218

https://doi.org/10.1145/567532.567555

Published: 26 January 1981 Publication History

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.

References

[1]

{AbKL79} W. Abu-Sufah, D. Kuck, and D. Lawrie, "Automatic Program Transformations for Virtual Memory Computers," Proc. of the 1979 Nat'l. Computer Conf., pp. 969-974, June 1979.

[2]

{AcDe79} W. B. Ackerman and J. B. Dennis, "Val--A Value-Oriented Algorithmic Language: Preliminary Reference Manual," Lab. for Computer Science (TR-218), MIT, Cambridge, MA, June 1979.

Digital Library

[3]

{AhHU74} A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, MA, 1974.

Digital Library

[4]

{AhU173} A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 2: Compiling, Prentice-Hall, Englewood Cliffs, NJ, 1973.

Digital Library

[5]

{AlCo72} F. E. Allen and J. Cocke, "A Catalogue of Optimizing Transformations," in Design and Optimization of Compilers (R. Rustin, Ed.), Prentice-Hall, Inc., NJ, pp. 1-30, 1972.

[6]

{ArGP78} Arvind, K. P. Gostelow, and W. Plouffe, "An Asynchronous Programming Language and Computing Machine," University of California at Irvine, CA, Dept. of Information and Computer Science Rpt. 114a, Dec. 1978.

[7]

{AsMa75} E. Ascroft and Z. Manna, "Translating Program Schemes to While-Schemas," SIAM J. on Computing, Vol. 4, No. 2, pp. 125-146, June 1975.

[8]

{BaGK80} U. Banerjee, D. Gajski, and D. J. Kuck, "Array Machine Control Units for Loops Containing IFs," Proc. of the 1980 Int'l. Conf. on Parallel Processing, Harbor Springs, MI, pp. 28-36, Aug. 1980.

[9]

{Bake77} B. S. Baker, "An Algorithm for Structuring Flow Graphs," J. of the ACM, Vol. 24, No. 1, pp. 98-120, Jan. 1977.

Digital Library

[10]

{Bane76} U. Banerjee, "Data Dependence in Ordinary Programs," M. S. thesis, Univ. of Ill. at Urbana-Champaign, Dept. of Comput. Sci. Rpt. No. 76-837, Nov. 1976.

[11]

{Bane79} U. Banerjee, "Speedup of Ordinary Programs," Ph.D. thesis, Univ. of Ill. at Urb.-Champ., Dept. of Comput. Sci. Rpt. No. 79-989, Oct. 1979.

Digital Library

[12]

{BCKT79} U. Banerjee, S. C. Chen, D. J. Kuck, and R. A. Towle, "Time and Parallel Processor Bounds for Fortran-Like Loops," IEEE Trans. on Computers, Vol. C-28, No. 9, pp. 660-670, Sept. 1979.

[13]

{Beat74} J. C. Beatty, "Register Assignment Algorithm for Generation of Highly Optimized Object Code," IBM J. of Res. and Dev., Vol. 18, No. 1, pp. 20-39, Jan. 1974.

Digital Library

[14]

{BoJa66} C. Bohm and G. Jacopini, "Flow Diagrams, Turing Machines and Languages with Only Two Formation Rules," Comm. of the ACM, Vol. 9, No. 5, pp. 366-371, May 1966.

Digital Library

[15]

{Cock70} J. Cocke, "Global Subexpression Elimination," SIGPLAN Notices, Vol. 5, No. 7, pp. 20-24, 1970.

Digital Library

[16]

{DayW70} W. H. E. Day, "Compiler Assignment of Data Items to Registers," IBM Systs. J., Vol. 9, No. 4, pp. 281-317, 1970.

Digital Library

[17]

{DuKn78} D. D. Dunlop and J. C. Knight, "Register Allocation in the SL/1 Compiler," Proc. of the 1978 LASL Workshop on Vector & Parallel Processors, LA-7491-C, Los Alamos, NM, pp. 205-211, Sept. 1978.

[18]

{Grie71} D. Gries, Compiler Construction for Digital Computers, Wiley & Sons, NY, 1971.

Digital Library

[19]

{GrWe76} S. L. Graham and M. Wegman, "A Fast and Usually Linear Algorithm for Global Flow Analysis," J. of the ACM, Vol. 23, No. 1, pp. 172-202, 1976.

Digital Library

[20]

{KKLW80} D. J. Kuck, R. H. Kuhn, B. Leasure, and M. Wolfe, "Analysis and Transformation of Programs for Parallel Computation," to appear in Proc. of the Fourth Int'l. Computer Software & Applications Conf., Oct. 1980.

[21]

{Kuck78} D. J. Kuck, The Structure of Computers and Computations, Vol. I, John Wiley & Sons, Inc., NY, 1978.

Digital Library

[22]

{Kuck80} D. J. Kuck, Class Notes for C. S. 433, Univ. of Ill. at Urb.-Champ., Dept. of Comput. Sci., 1979.

[23]

{KuMC72} D. J. Kuck, Y. Muraoka, and S. C. Chen, "On the Number of Operations Simultaneously Executable in FORTRAN-Like Programs and Their Resulting Speed-Up," IEEE Trans. on Computers, Vol. C-21, No. 12, pp. 1293-1310, Dec. 1972.

[24]

{Love77} D. B. Loveman, "Program Improvement by Source-to-Source Transformation," J. of the ACM, Vol. 20, No. 1, pp. 121-145, Jan. 1977.

Digital Library

[25]

{LuBa80} S. F. Lundstrom and G. H. Barnes, "A Controllable MIMD Architecture," Proc. of the 1980 Int'l. Conf. on Parallel Processing, pp. 19-27, Aug. 1980.

[26]

{PaKL80} D. A. Padua, D. J. Kuck, and D. H. Lawrie, "High-Speed Multiprocessors and Compilation Techniques," Special Issue on Parallel Processing, IEEE Trans. on Computers, Vol. C-29, No. 9, pp. 763-776, Sept. 1980.

[27]

{Park77} D. S. Parker, Jr., "Nonlinear Recurrences and Parallel Computation," in High Speed Computer and Algorithm Organization, pp. 317-320, Academic Press, Inc., 1977.

[28]

{ZeBa74} M. V. Zelkowitz and W. G. Bail, "Optimization of Structured Programs," Software Practice and Experience, Vol. 4, No. 1, pp. 51-57, 1974.

Cited By

Vlasenko AMichurov MTsarev VKurbatov M(2024)Constructing a Complex for Automated Debugging of Fragmented ProgramsVestnik NSU. Series: Information Technologies10.25205/1818-7900-2024-22-1-5-2022:1(5-20)Online publication date: 16-Jul-2024
https://doi.org/10.25205/1818-7900-2024-22-1-5-20
Abdi JPosluns GZhang GWang BJeffrey MAgrawal KPetrank E(2024)When Is Parallelism Fearless and Zero-Cost with Rust?Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659966(27-40)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659966
Wang YHuo DLi CWang SGuo XZhou QWang Y(2024)Cross-Architecture IoT Firmware Similarity Comparison Based on Multi-Layer GCN2024 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC61673.2024.10733598(1-7)Online publication date: 26-Jun-2024
https://doi.org/10.1109/ISCC61673.2024.10733598
Show More Cited By

Dependence graphs and compiler optimizations
1. Software and its engineering
  1. Software notations and tools
2. Theory of computation
  1. Models of computation
    1. Concurrency

Recommendations

Collapsible graphs and Hamiltonian connectedness of line graphs

Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, ...
Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied Mathematics
Abstract
Comparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset $P = (V, \leq)$ is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...
Equimatchable Graphs on Surfaces

A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '81: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1981

230 pages

ISBN:089791029X

DOI:10.1145/567532

Conference Chairs:
John White
University of Connecticut, Storrs, Connecticut
,
Richard Lipton
Princeton University, Princeton, NJ
,
Program Chair:
Patricia C. Goldberg
IBM Thomas J. Watson Research Center, Yorktown Heights, NY

Copyright © 1981 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 January 1981

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

POPL '81 Paper Acceptance Rate 24 of 121 submissions, 20%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

560
Total Citations
View Citations
3,036
Total Downloads

Downloads (Last 12 months)451
Downloads (Last 6 weeks)60

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Vlasenko AMichurov MTsarev VKurbatov M(2024)Constructing a Complex for Automated Debugging of Fragmented ProgramsVestnik NSU. Series: Information Technologies10.25205/1818-7900-2024-22-1-5-2022:1(5-20)Online publication date: 16-Jul-2024
https://doi.org/10.25205/1818-7900-2024-22-1-5-20
Abdi JPosluns GZhang GWang BJeffrey MAgrawal KPetrank E(2024)When Is Parallelism Fearless and Zero-Cost with Rust?Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659966(27-40)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659966
Wang YHuo DLi CWang SGuo XZhou QWang Y(2024)Cross-Architecture IoT Firmware Similarity Comparison Based on Multi-Layer GCN2024 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC61673.2024.10733598(1-7)Online publication date: 26-Jun-2024
https://doi.org/10.1109/ISCC61673.2024.10733598
Denisov LMagnani GCattaneo DAgosta GCherubin S(2024)The Impact of Profiling Versus Static Analysis in Precision TuningIEEE Access10.1109/ACCESS.2024.340183112(69475-69487)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3401831
Yuan DFang SZhang TXu ZLuo X(2023)Java Code Clone Detection by Exploiting Semantic and Syntax Information From Intermediate Code-Based GraphIEEE Transactions on Reliability10.1109/TR.2022.317692272:2(511-526)Online publication date: Jun-2023
https://doi.org/10.1109/TR.2022.3176922
Zheheng LJianming CWuqiang SChaosheng YLulu W(2023)ECIA: Elaborate Change Impact Analysis Based on Sub-Statement Level Dependency Graph2023 IEEE 23rd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)10.1109/QRS-C60940.2023.00032(471-480)Online publication date: 22-Oct-2023
https://doi.org/10.1109/QRS-C60940.2023.00032
Metz CPlump CBerger BDrechsler R(2023)Hybrid PTX Analysis for GPU accelerated CNN inferencing aiding Computer Architecture Design2023 Forum on Specification & Design Languages (FDL)10.1109/FDL59689.2023.10272088(1-8)Online publication date: 13-Sep-2023
https://doi.org/10.1109/FDL59689.2023.10272088
Hu XBurgstaller BScholz B(2023)EVMTracer: Dynamic Analysis of the Parallelization and Redundancy Potential in the Ethereum Virtual MachineIEEE Access10.1109/ACCESS.2023.326727711(47159-47178)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3267277
Wang LHu PKong XOuyang WLi BXu HShao T(2023)Microservice architecture recovery based on intra-service and inter-service featuresJournal of Systems and Software10.1016/j.jss.2023.111754204:COnline publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111754
Zoor MApvrille LPacalet RCoudert S(2023)Execution trace analysis for a precise understanding of latency violationsSoftware and Systems Modeling10.1007/s10270-022-01076-z22:5(1519-1541)Online publication date: 6-Jan-2023
https://doi.org/10.1007/s10270-022-01076-z
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents