DIANA: an intermediate language for Ada
DIANA: an intermediate language for Ada
Global optimization by suppression of partial redundancies
Communications of the ACM
A portable optimizing compiler for Modula-2
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
A portable machine-independent global optimizer--design and measurements
A portable machine-independent global optimizer--design and measurements
Subprogram Inlining: A Study of its Effects on Program Execution Time
IEEE Transactions on Software Engineering
Run-time check elimination for Ada 9X
TRI-Ada '94 Proceedings of the conference on TRI-Ada '94
Elimination of redundant array subscript range checks
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
A new algorithm for partial redundancy elimination based on SSA form
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Proceedings of the 1999 annual ACM SIGAda international conference on Ada
Partial redundancy elimination in SSA form
ACM Transactions on Programming Languages and Systems (TOPLAS)
From flop to megaflops: Java for technical computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
From Flop to MegaFlops: Java for Technical Computing
LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
Optimizing array reference checking in Java programs
IBM Systems Journal
Efficient and effective array bound checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
In this paper we describe the design of a global machine independent low level optimizer for the Karlsruhe Ada Compiler. We give a short overview on the optimizations and data structures used in the optimizer as well as some experiences with the optimizer. Detailed measurements are provided for a collection of benchmarks. The average improvement of code speed is 40%.