Marmot: an optimizing compiler for Java

Software - Practice and Experience

Volumn 30, Issue 3, 2000, Pages 199-232

  Fitzgerald, Robert ^a   Knoblock, Todd B ^a   Ruf, Erik ^a   Steensgaard, Bjarne ^a   Tarditi, David ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTER SOFTWARE SELECTION AND EVALUATION; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; PROGRAM TRANSLATORS; SYSTEMS ANALYSIS;

MARMOT SYSTEM; NATIVE CODE COMPILER; RUNTIME SYSTEM;

PROGRAM COMPILERS;

EID: 0033889980     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-024X(200003)30:3<199::AID-SPE296>3.0.CO;2-2     Document Type: Article

References (62)

1. Gosling J, Joy B, Steele G. The Java Language Specification. The Java Series; Addison-Wesley: Reading, MA, June 1996.
2. Muchnick SS. Advanced Compiler Design and Implementation; Morgan Kaufmann: San Francisco, CA, 1997.
3. Bacon DF, Sweeney PF. Fast static analysis of C++ virtual function calls. Proceedings OOPSLA '96, ACM SIGPLAN Notices, October 1996; 324-341. (ACM SIGPLAN Notices, 31(10).)
4. Bacon DF, Sweeney PF. Fast static analysis of C++ virtual function calls. Proceedings OOPSLA '96, ACM SIGPLAN Notices, October 1996; 324-341. (ACM SIGPLAN Notices, 31(10).)
5. Dean J, Grove D, Chambers C. Optimization of object-oriented programs using static class hierarchy analysis. Proceedings ECOOP'95, Olthoff W (ed.), LNCS, 952, Aarhus, Denmark, August 1995; 77-101. Springer-Verlag.
6. Cytron R, Ferrante J, Rosen BK, Wegman MN, Zadeck FK. An efficient method of computing static single assignment form. Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, January 1989.
7. Tarditi D. Design and implementation of code optimizations for a type-directed compiler for standard ML. PhD thesis, Carnegie Mellon University, December 1996.
8. Lindholm T, Yellin F. The Java Virtual Machine Specification, The Java Series; Addison-Wesley: Reading, MA, 1997.
9. Aho AV, Sethi R, Ullman JD. Compilers: Principles, Techniques, and Tools; Addison-Wesley: Reading, MA, 1986.
10. Appel AW. Modern Compiler Implementaton in Java; Cambridge University Press, 1998.
11. Chang PP, Mahlke SA, Chen WY, Hwu W-mW. Profile-guided automatic inline expansion for C programs. Software -Practice and Experience 1991; 22(5):349-369.
12. Cousot P, Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages, Los Angeles, January 1977; 238-252.
13. Freund SN. The costs and benefits of Java bytecode subroutines. Formal Underpinnings of Java Workshop at OOPSLA, 1998.
14. Cytron R, Ferrante J, Rosen BK, Wegman MN. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 1991; 13(4):451-490.
15. Lengauer T, Tarjan RE. A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems 1979; 1(1):121-141.
16. Sreedhar VC, Gao GR. A linear time algorithm for placing φ-nodes. Proceedings 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1995; 62-73.
17. Gagnon E, Hendren L. Intra-procedural inference of static types for Java bytecode. Technical Report 1, McGill University, Canada 1999.
18. Dean J, DeFouw G, Grove D, Litvinov V, Chambers C. Vortex: An optimizing compiler for object-oriented languages. Proceedings OOPSLA '96, ACM SIGPLAN Notices, October 1996; 83-100.
19. Markstein V, Cocke J, Markstein P. Optimization of range checking. Proceedings of the ACM SIGPLAN '86 Symposium on Compiler Construction, June 1982; 114-119.
20. Gupta R. A fresh look at optimizing array bound checking. Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, June 1990; 272-282.
21. Asuru JM. Optimization of array subscript range checks. ACM Letters on Programming Languages and Systems 1991; 1(2):109-118.
22. Gupta R. Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems 1993; 2(1-4):135-150.
23. Chin W-N, Goh E-K. A reexamination of "optimization of array subscript range checks". ACM Transactions on Programming Languages and Systems 1995; 17(2):217-227.
24. Kolte P, Wolfe M. Elimination of redundant array subscript range checks. Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation, 1995; 270-278.
25. Suzuki N, Ishihata K. Implementation of an array bound checker. Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages, January 1977; 132-143.
26. Xi H, Pfenning F. Eliminating array bound checking through dependent types. Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation, 1998.
27. Dantzig GB, Eaves BC. Fourier-Motzkin elimination and its dual. Journal of Combinatorial Theory (A) 1973; 14:288-297.
28. Duffin RJ. On Fourier's analysis of linear inequality systems. Mathematical Programming Study 1; North Holland: New York, 1974; 71-95.
29. Williams HP. Fourier-Motzkin elimination extension to integer programming problems. Journal of Conbinatorial Theory (A) 1976; 21:118-123.
30. Bacon DF. Fast and effective optimization of statically typed object-oriented languages. PhD thesis, U.C. Berkeley, October 1997.
31. Gay D, Steensgaard B. Stack allocating objects in Java. In preparation, 1999.
32. Muller G, Moura B, Bellard F, Consel C. Harissa: a flexible and efficient Java environment mixing bytecode and compiled code. Proceedings of the Third Conference on Object-Oriented Technologies and Systems (COOTS '97), 1997.
33. Cooper KD, Lu J. Register promotion in C programs. Proceedings of the SIGPLAN '97 Conference on Programming Language Design and Implementation, 1997; 308-319.
34. Lo R, Chow F, Kennedy R, Lu S-M, Tu P. Register promotion by sparse partial redundancy elimination of loads and stores. Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation, June 1998; 26-37.
35. Choi J-D, Sarkar V, Schonberg E. Incremental computation of static single assignment form. CC '96: Sixth International Conference on Compiler Construction, LNCS, 1060, April 1996; 223-237. Springer-Verlag.
36. Wolfe M. High Performance Compilers for Parallel Computing; Addison-Wesley: Reading, MA, 1996.3
37. Briggs P, Cooper KD, Harvey TJ, Simpson LT. Practical improvements to the construction and destruction of static single assignment form. Software - Practice and Experience 1988; 1(1).
38. Chaitin GJ, Auslander MA, Chandra AK, Cocke J, Hopkins ME, Markstein PW. Register allocation via coloring. Computer Languages 1981; 6(1):47-57.
39. Chaitin GJ. Register allocation and spilling via graph coloring. Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction, June 1982; 98-105.
40. Briggs P, Cooper KD, Torczon L. Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems 1994; 16(3):428-455.
41. Park J, Moon S-M. Optimistic register coalescing. International Conference on Parallel Architectures and Compilation Techniques, Gaudiot J-L (ed.), Paris, October 1998; 196-204.
42. Briggs P. Register allocation via graph coloring. PhD thesis, Rice University, April 1992.
43. Bacon DF, Konuru R, Murthy C, Serrano M. Thin locks: Featherweight synchronization for Java. Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation, June 1998; 258-268.
44. Vitek J, Horspool RN, Krall A. Efficient type inclusion tests. Proceedings OOPSLA '97, ACM SIGPLAN Notices, October 1997; 142-157.
45. Krall A, Grafl R. CACAO - a 64 bit JavaVM just-in-time compiler. Concurrency: Practice and Experience 1997; 9(11):1017-1030.
46. Chan P, Lee R. The Java Class Libraries, Vol. 1; Addison-Wesley: Reading, MA, 1998.
47. Chan P, Lee R. The Java Class Libraries. Vol. 2; Addison-Wesley: Reading, MA, 1998.
48. Hsieh C-HA, Gyllenhaal JC, Hwu WmW. Java bytecode to native code translation: The Caffeine prototype and preliminary results. IEEE Proceedings of the 29th Annual International Symposium on Microarchitecture, 1996.
49. Hsieh C-HA, Conte MT, Johnson TL, Gyllenhaal JC, Hwu WmW. Optimizing NET compilers for improved Java performance. Computer 1997; 30(6):67-75.
50. Neffenger J. Which Java VM scales best? JavaWorld 1998; 3(8).
51. Diwan A, Moss JEB, Hudson RL. Compiler support for garbage collection in a statically typed language. Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, San Francisco, CA, June 1992; 273-282.
52. Halfhill TR. Benchmarking Java. BYTE Magazine 1998.
53. Proebsting TA, Townsend G, Bridges P, Harman JH, Newsham T, Watterson SA. Toba: Java for applications: A way ahead of time (WAT) compiler. Proceedings of the Third Conference on Object-Oriented Technologies and Systems (COOTS '97), 1997.
54. The Open Group. TurboJ high performance Java compiler, http://www.camb.opengroup.com/openitsol/turboj/ [February 1998].
55. Kienle H, Hölzle U. j2s: A SUIF Java compiler. Proceedings of the Second SUIF Compiler Workshop, August 1997.
56. Mathew S, Dahlman E, Gupta S. Compiling Java to SUIF: Incorporating support for object-oriented languages. Proceedings of the Second SUIF Compiler Workshop, August 1997.
57. Tower Technology. TowerJ, release 2. http://www.twr.com/ [September 1998].
58. SuperCede, Inc. SuperCede for Java, Version 2.03, Upgrade Edition, http://www.supercede.com/ [September 1998].
59. Symantec Corporation. Visual Café Pro. http://www.symantec.com/ [September 1998].
60. Hölzle U, Bak L, Grarup S, Griesemer R, Mitrovic S. Java on steroids: Sun's high-performance Java implementation. Presentation at Hot Chips IX, Stanford, CA, USA, August 1997.
61. Instantiations, Inc. Jove: Super optimizing deployment environment for Java. http://www.instantiations.com/javaspeed/jovereport.htm [July 1998].
62. NaturalBridge, LLC. Bullettrain Java compiler technology, http://www.naturalbridge.com/ [1998].