Marmot: an optimizing compiler for Java
Robert P. Fitzgerald, Todd B. Knoblock, Erik Ruf et al. · Software Practice and Experience · 2000
The Marmot system is a research platform for studying the implementation of high level programming languages. It currently comprises an optimizing native-code compiler, runtime system, and libraries for a large subset of Java. Marmot integrates well-known representation, optimization, code generation, and runtime techniques with a few Java-specific features to achieve competitive performance. This paper contains a description of the Marmot system design, along with highlights of our experience applying and adapting traditional implementation techniques to Java. A detailed performance evaluation assesses both Marmot's overall performance relative to other Java and C++ implementations, and the relative costs of various Java language features in Marmot-compiled code. Our experience with Marmot has demonstrated that well-known compilation techniques can produce very good performance for static Java applications – comparable or superior to other Java systems, and approaching that of C++ in some cases. Copyright © 2000 John Wiley & Sons, Ltd.
Cited by 141 works. doi:10.1002/(sici)1097-024x(200003)30:3<199::aid-spe296>3.0.co;2-2
Authors
References
- Compilers: Principles, Techniques, and Tools
- The Java Language Specification
- Abstract interpretation
- Java Virtual Machine Specification
- Register allocation via coloring
- Advanced Compiler Design and Implementation
- Efficiently computing static single assignment form and the control dependence graph
- Register allocation & spilling via graph coloring
- Optimization of range checking
- High-Performance Compilers for Parallel Computing