article

Free access

Sharlit—a tool for building optimizers

Authors:

Steven W. K. Tjiang,

John L. HennessyAuthors Info & Claims

ACM SIGPLAN Notices, Volume 27, Issue 7

Pages 82 - 93

https://doi.org/10.1145/143103.143120

Published: 01 July 1992 Publication History

PDF eReader

Abstract

A complex and time-consuming function of a modern compiler is global optimization. Unlike other functions of a compiler such as parsing and code generation which examine only one statement or one basic block at a time, optimizers are much larger in scope, examining and changing large portions of a program all at once. The larger scope means optimizers must perform many program transformations. Each of these transformations makes its own particular demands on the internal representation of programs; each can interact with and depend on the others in different ways. This makes optimizers large and complex.

Despite their complexity, few tools exist to help in building optimizers. This is in stark contrast with other parts of the compiler where years of experience have culminated in tools with which these other parts can be constructed easily. For example, parser generators are used to build front-ends, and peephole optimizers and tree matchers are used to build code generators.

This paper presents Sharlit, a tool to support the construction of modular and extensible global optimizers. We will show how Sharlit helps in constructing data-flow analyzers and the transformations that use data-flow analysis information, both are major components of any optimizer.

Sharlit is implemented in C++ and uses C++ in the same way that YACC uses C. Thus we assume the reader has some familiarity with C++[9].

References

[1]

A.V. Aho, R. Sethi, J.D. Ullman, Compilers, Principles, Techniques, and Tools. Addison-Wesley; 1986.

Digital Library

Google Scholar

[2]

Z. Ammarguellat and W. L. Harrison ilI, Automatic recognition of induction variables and recurrence relations by abstract interpretation. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Langua,~e Design and Implementation.

Digital Library

Google Scholar

[3]

M. Berry et al, The PERFECT Club Benchmarks: effective performance evaluation of supercomputers. Technical Report UIUCSRD Rep. No. 827, University of Illinoi,~ Urbana-Champaign, 1989.

Digital Library

Google Scholar

[4]

J. Choi, R. Cytron, and j. Ferrante, Automatic construction of sparse data flow evaluation graphs, In POPL 1991.

Digital Library

Google Scholar

[5]

E Chow, A Portable Machine-Independent Global Optimizer, PhD thesis, Stanford Universit3~ 1983

Digital Library

Google Scholar

[6]

M.S. Hecht and J.D. UUman. A simple algorithm for global data-flow analysis programs, In SIAM J. Computing. (4):519-532.

Google Scholar

[7]

E. Morel and C. Renvoise, Global optimization by suppression of partial redundancies, In Communications of the ACM. (22):96-103

Digital Library

Google Scholar

[8]

M. Sharir. "Structural analysis: a new approach to flow analysis in optimizing compilers". Computer Languages 5 (1980), 141-153.

Digital Library

Google Scholar

[9]

B. Stroustrup, The C++ Programming Language, Addisx~n- Wesle36 Reading, Mass.

Digital Library

Google Scholar

[10]

R.E. Tarjan. "Testing flow graph reducibility", j. of Comput. and Syst. Sci. (9 1974), 355-365.

Google Scholar

[11]

R.E. Tarjan, Fast algorithms for solving Path problems. journal of the ACM, 3(28):591-642, July 1981.

Digital Library

Google Scholar

[12]

S. Tjiang, M. E. Wolf, M. S. Lain, K. L. Pieper, and J. L. Henness3~ Integrating scalar optimization and parallelization, In 4th Workshop on Languages and Compilers for Parallel Computing, Aug 199I.

Digital Library

Google Scholar

[13]

j.D. Ullman. "Fast algorithms for the elimination of common subexpressions'. Acta Inf. 2, 3 (July 1973), 191- 213.

Digital Library

Google Scholar

Cited By

View all

Li JAppel A(2021)Deriving efficient program transformations from rewrite rulesProceedings of the ACM on Programming Languages10.1145/34735795:ICFP(1-29)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473579
Paleri V(2010)Automatic Generation of Code Optimizers from Formal SpecificationsThe Compiler Design Handbook10.1201/9781420040579.ch2Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch2
Kalvala SWarburton RLacey D(2009)Program transformations using temporal logic side conditionsACM Transactions on Programming Languages and Systems10.1145/1516507.151650931:4(1-48)Online publication date: 26-May-2009
https://dl.acm.org/doi/10.1145/1516507.1516509
Show More Cited By

Index Terms

Sharlit—a tool for building optimizers
1. Software and its engineering
  1. Software creation and management
    1. Designing software
      1. Software implementation planning
        Software design techniques
    2. Software development process management
  2. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types

Recommendations

Sharlit—a tool for building optimizers
PLDI '92: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation

A complex and time-consuming function of a modern compiler is global optimization. Unlike other functions of a compiler such as parsing and code generation which examine only one statement or one basic block at a time, optimizers are much larger in ...
Automatic generation of interprocedural data-flow analyzers and optimizers
Abstract
Interprocedural analysis and optimization are very important for compilers to exploit parallelism of modern high-performance computer systems. But it is very complicated, easy to make mistakes and difficult to maintain and port. To solve the ...
Inter-particle communication and search-dynamics of lbest particle swarm optimizers: An analysis

Particle Swarm Optimization (PSO) is arguably one of the most popular nature-inspired algorithms for real parameter optimization at present. The existing theoretical research on PSO focuses on the issues like stability, convergence, and explosion of the ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 27, Issue 7

July 1992

352 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/143103

Editor:
Richard Wexelblat
IDA/CDED, Alexandria, VA

Issue’s Table of Contents

PLDI '92: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
July 1992
352 pages
ISBN:0897914759
DOI:10.1145/143095
Chairman:
Stuart I. Feldman
Bell Communications Research, Morristown, NJ
,
Editor:
Richard L. Wexelblat

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Published in SIGPLAN Volume 27, Issue 7

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

64
Total Citations
View Citations
511
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)10

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li JAppel A(2021)Deriving efficient program transformations from rewrite rulesProceedings of the ACM on Programming Languages10.1145/34735795:ICFP(1-29)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473579
Paleri V(2010)Automatic Generation of Code Optimizers from Formal SpecificationsThe Compiler Design Handbook10.1201/9781420040579.ch2Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch2
Kalvala SWarburton RLacey D(2009)Program transformations using temporal logic side conditionsACM Transactions on Programming Languages and Systems10.1145/1516507.151650931:4(1-48)Online publication date: 26-May-2009
https://dl.acm.org/doi/10.1145/1516507.1516509
Zeng JMitchell CEdwards S(2006)A Domain-Specific Language for Generating Dataflow AnalyzersElectronic Notes in Theoretical Computer Science10.1016/j.entcs.2006.10.008164:2(103-119)Online publication date: Oct-2006
https://doi.org/10.1016/j.entcs.2006.10.008
Hall MAmarasinghe SMurphy BLiao SLam M(2005)Interprocedural parallelization analysis in SUIFACM Transactions on Programming Languages and Systems10.1145/1075382.107538527:4(662-731)Online publication date: 1-Jul-2005
https://dl.acm.org/doi/10.1145/1075382.1075385
Braun VKnoop JKoschützki D(2005)Cool: A control-flow generator for system analysisCompiler Construction10.1007/BFb0026442(306-309)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0026442
Lerner SGrove DChambers C(2002)Composing dataflow analyses and transformationsACM SIGPLAN Notices10.1145/565816.50329837:1(270-282)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.1145/565816.503298
Lerner SGrove DChambers CLaunchbury JMitchell J(2002)Composing dataflow analyses and transformationsProceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/503272.503298(270-282)Online publication date: 16-Jan-2002
https://dl.acm.org/doi/10.1145/503272.503298
Assmann U(2000)Graph rewrite systems for program optimizationACM Transactions on Programming Languages and Systems10.1145/363911.36391422:4(583-637)Online publication date: 1-Jul-2000
https://dl.acm.org/doi/10.1145/363911.363914
Lev-Ami TSagiv M(2000)TVLA: A System for Implementing Static AnalysesStatic Analysis10.1007/978-3-540-45099-3_15(280-301)Online publication date: 2000
https://doi.org/10.1007/978-3-540-45099-3_15
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations