Simple and effective link-time optimization of Modula-3 programs
- 1 June 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 30 (6), 103-115
- https://doi.org/10.1145/207110.207121
Abstract
This paper, we describe the opportunities for link-time optimization of Modula-3 and present two link-time optimization techniques. Data-driven simplification is a new technique. It uses a program's type hierarchy to recover completely the cost of opaque types and to reduce the runtime overhead of methods. It also reveals other opportunities for optimization, such as constant and type propagation and procedure inlining and cloning. Profile-driven optimization uses profile data to identify and...Keywords
This publication has 16 references indexed in Scilit:
- Optimizing dynamically-dispatched calls with run-time type feedbackPublished by Association for Computing Machinery (ACM) ,1994
- Link-time optimization of address calculation on a 64-bit architecturePublished by Association for Computing Machinery (ACM) ,1994
- Engineering a simple, efficient code-generator generatorACM Letters on Programming Languages and Systems, 1992
- Experience with a software-defined machine architectureACM Transactions on Programming Languages and Systems, 1992
- BURGACM SIGPLAN Notices, 1992
- Making pure object-oriented languages practicalACM SIGPLAN Notices, 1991
- Hard‐coding bottom‐up code generation tables to save time and spaceSoftware: Practice and Experience, 1991
- A portable global optimizer and linkerACM SIGPLAN Notices, 1988
- Self: The power of simplicityACM SIGPLAN Notices, 1987
- Static grouping of small objects to enhance performance of a paged virtual memoryACM Transactions on Computer Systems, 1984