Michael G. Burke
David Grove
Michael Hind
Vivek Sarkar
- 1.A.V. Aho, R. Sethi, and J.D. UNman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.]] Google Scholar
Digital Library
- 2.Ali-Reza Ald-Tabatabai, Michal Cierniak, Guei-Yuan Lueh, Vishesh M. Parikh, and James M. Stichnoth. Fast, effective code generation in a just-in-time Java compiler. In SIGPLAN 'g8 Conference on Programming Language Design and Implementation, 1998.]] Google ScholarDigital Library
- 3.Glen Ammons, Thomas Ball, and James R. Larus. Exploiting hardware performance counters with flow and context sensitive profiling. In SIGPLAN '97 Conference on Programming Language Design and Implementation, 1997.]] Google ScholarDigital Library
- 4.Ken Arnold and James Gosling.The Java Programming Language. Addison-Wesley, 1996.]] Google ScholarDigital Library
- 5.Joel Auslander, Matthai Philipose, Craig Chambers, Susan J. Eggers, and Brian N. Bershad. Fast, effective dynamic compilation. In SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 149-159, May 1996.]] Google ScholarDigital Library
- 6.B. Blancher. Escape analysis: Correctness, proof, implementation and experimental results. In $Sth Annual A CM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages, pages 25-37, January 1998.]] Google ScholarDigital Library
- 7.Michael Burke and Linda Torczon. InterprocedurM optimization: Eliminating unnecessary recompilation. A CM Transactions on Programming Languages and Systems, 15(3):367- 399, July 1993.]] Google ScholarDigital Library
- 8.Craig Chambers. The Design and Implementation of ~he Self Compiler, an Optimizing Compiler for Object-Oriented Programming Languages. PhD thesis, Stanford University, March 1992. Published as technical report STAN-CS-92- 1420.]] Google ScholarDigital Library
- 9.Craig Chambers, Jeffrey Dean, and David Grove. Wholeprogram optimization of object-oriented languages. Technical Report UW-CSE-96-06-02, University of Washington, Department of Computer Science and Engineering, june 1996.]]Google Scholar
- 10.Craig Chambers and David Ungar. Iterative type analysis and extended message splitting: Optimizating dynamicallytyped object-oriented programs. In A CM Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 150-164, 1990.]] Google ScholarDigital Library
- 11.Jong-Deok Choi, Manish Gupta, Mauricio Serrano, Vugraham Sreedhar, and Sam Midkiff. Escape analysis for Jav~. Technical report, IBM T.J. Watson Research Center, 1999.]]Google Scholar
- 12.Fred C. Chow. Minimizing Register Usage Penalty at Procedure Calls. In SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 85-94, July 1988. SIGPLAN Notices, $3(7).]] Google ScholarDigital Library
- 13.Charles Consel and Franccois Noel. A general approach for run-time specialization and its application to C. In $3rd Annual A CM SIGA CT-SIGPLAN Symposium on the Principles of Programming Languages, pages 145-156, January 1996.]] Google ScholarDigital Library
- 14.The Standard Performance Evaluation Corporation. SPEC JVM98 Benchmarks. http://www.spec.org/osg/jvm98/, 1998.]]Google Scholar
- 15.R.R. Henry C.W. Fraser and T.A. Proebsting. Burg- fast optimal instruction selection and tree parsing. In SIGPLAN '92 Conference on Programming Language Design and Implementation, 1992.]]Google Scholar
- 16.L. Peter Deutsch and Allan M. Schiffman. Efficient implementation of the SmalltMk-80 system. In 11th Annual A GM Symposium on ~he Principles o} Programming Languages, pages 297-302, January 1984.]] Google ScholarDigital Library
- 17.M. Anton Ert}. Optimal code selection in DAGs. In ~6th Annual ACId SIGACT-SIGPLAN SymVosium on ~he Principles of Programming Languages, January 1999.]] Google ScholarDigital Library
- 18.Robert Fitzgerald, Todd B. Knoblock, Erik Ruf, Bjarne Steensgaard, and David Tarditi. Marmot: an optimzing compiler for java. submitted for publication, draft at http://www.research.microsoft.com/apl{, October 1998.]]Google Scholar
- 19.Brian (}rant, Markus Mock, Matthai Philipose, Craig Chambers, and Susan J. Eggers. DyC: An expressive annotationdirected dynamic compiler for C. Theoretical Computer Science, to appear.]] Google ScholarDigital Library
- 20.Dave Grove, Greg DeFouw, Jeffrey Dean, and Craig Chambers. Call graph construction in object-orientedlanguages, in A CM Conference on Object-O~iented Programming Systems, Languages, and Applications, pages 108-124, October 1997.]] Google ScholarDigital Library
- 21.Urs H61zle and David Ungar. Optimizing dynamicallydispatched calls with run-time type feedback. In $IGPLAN '94 Conference on Programming Language Design and Implementation, pages 326-336, June 1994. SIGPLAN Notices,]] Google ScholarDigital Library
- 22.IBM. IBM's high performance compiler for java. White paper at http://www.alphaworks.ibm.com.]]Google Scholar
- 23.Kazuaki Ishizaki, Motohiro Kawshito, Toshiaki Yasue, Mikio Takeuchi, Takeshi Ogasawara, Toshio Suganama, Tamiya Onodera, Hideaki Komatsu, and Toshio Nakatani. Design, implementation, and evaluation of optimisations in a justin-time compiler. In A CM Java Grande Conference, San Fransisco, CA, June 1999.]] Google ScholarDigital Library
- 24.Richard Jones and Rafael Lins. Garbage Collection Algorithms for Automatic Dynamic Memory Management John Wiley & Sons, 1996.]] Google ScholarDigital Library
- 25.Jove.Jove, super optimizing deployment environment for Java.White paper at http://www.inst antiations.com/j avaspeed/j overeport.ht m.]]Google Scholar
- 26.Michael Karasick. The architecture of Montana: An open and extensible programming environment with an incremental c++ compiler. In Siz~h International Symposium on Foundations of Software Engineering, pages 131-142, November 1998.]] Google ScholarDigital Library
- 27.Kathleen Knobe and Vivek Sarkar. Array SSA form and its use in Parallelization. In ~5th Annual A CM SlGACT- SIGPLAN Symposium on the Principles of Programming Languages, January 1998.]] Google ScholarDigital Library
- 28.Kathleen Knobe and Vivek Sarkar. Conditional constant propagation of scalar and array references using array SSA form. In Giorgio Levi, editor, Lecture Notes in Computer Science, 1503, pages 33-56. Springer-Verlag, 1998. Proceedings from the 5th International Static Analysis Symposium.]]Google Scholar
- 29.Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification. The Java Series. Addison-Wesley, 1996.]] Google ScholarDigital Library
- 30.S. P. Midkiff, J. E. Moreira, and M. Snir. Optimizing bounds checking in Java programs. IBM Systems Journal, 37(3):409- 453, August 1998.]] Google ScholarDigital Library
- 31.Massimiliano Poletto, Dawson It. Engler, and M. Frans Kaashoek. tcc: A system for fast, flexible, and high-level dynamic code generation. In SIGPLAN '97 Con}erence on Programming Language Design and Implementation, pages 109-121, June 1997.]] Google ScholarDigital Library
- 32.Massimiliano Poletto and Vivek Sarlmr. Linear Scan Register Allocation. A GM TOPLAS, 1999. To appear.]] Google ScholarDigital Library
- 33.Vivek Sarkar, Mauricio J. Serrano, and Barbara B. Simons. "Retargeting Optimized Code by Matching Tree Patterns in Directed Acyclic Graphs", Patent Application, submitted in December 1998.]]Google Scholar
- 34.Peter A. Steenkiste and John L. Hennessy. A simple interprocedural register allocation algorithm and its effectiveness for LISP. A CM Transactions on Programming Languages and Systems, 11(1):1-32, 1989.]] Google ScholarDigital Library
- 35.Peter F. Sweeney and Frank Tip. A study of dead data members in C++ applications. In SIGPLAN '98 Con~create on Programming Language Design and Implementation, pages 324-332, June 1998. SIGPLAN Notices, 33(5).]] Google ScholarDigital Library
- 36.Antero Taivalsaari. Implementing a Java virtual machine in the java programming language. Technical Report SMLI TR-98-64, Sun Microsystems, March 1998.]] Google ScholarDigital Library
- 37.Frank Tip and Peter F. Sweeney. Class hierarchy specialization. In A CM ConJerence on Object-Oriented Programming Systems, Languages, and Applicatio,~, 1997.]] Google ScholarDigital Library
- 38.John Whaley. Dynamic optimization through the use of automatic runtime specialization. M.eng., Massachussetts Institute of Technology, May 1999.]]Google Scholar
- 39.P. Wu, S. P. Midkiff, J. S. Moreira, and M. Gupta. Efficient support for complex numbers in Java. In A CM Java Grande Con}erence, San Fransisco, CA, June 1999.]] Google ScholarDigital Library
Index Terms
- The Jalapeño dynamic optimizing compiler for Java
Recommendations
The jastadd extensible java compiler
OOPSLA '07: Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems, languages and applicationsThe JastAdd Extensible Java Compiler is a high quality Java compiler that is easy to extend in order to build static analysis tools for Java, and to extend Java with new language constructs. It is built modularly, with a Java 1.4 compiler that is ...
Implementing jalapeño in Java
OOPSLA '99: Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsJalapeño is a virtual machine for Java™ servers written in Java.
A running Java program involves four layers of functionality: the user code, the virtual-machine, the operating system, and the hardware. By drawing the Java / non-Java boundary below the ...
Implementing JNI in java for jalapeño
JVM'01: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1Developed at the IBM T. J. Watson Research Center, Jalapeño [1] is a Java virtual machine (JVM) written in Java that targets high-performance servers. The strategic decision early in the project to implement Jalapeño in Java [2] leads to many important ...
Comments