Compilation queuing and graph caching for dynamic compilers
暂无分享,去创建一个
[1] Urs Hölzle,et al. Reconciling responsiveness with performance in pure object-oriented languages , 1996, TOPL.
[2] Ron Cytron,et al. Does “just in time” = “better late than never”? , 1997, POPL '97.
[3] Cliff Click,et al. The Java HotSpot Server Compiler , 2001, Java Virtual Machine Research and Technology Symposium.
[4] Chandra Krintz,et al. Online phase detection algorithms , 2006, International Symposium on Code Generation and Optimization (CGO'06).
[5] Mark N. Wegman,et al. Efficiently computing static single assignment form and the control dependence graph , 1991, TOPL.
[6] David Gay,et al. Memory management with explicit regions , 1998, PLDI.
[7] Rainer Plaga. The GRAAL project , 1999 .
[8] Prasad A. Kulkarni,et al. JIT compilation policy for modern machines , 2011, OOPSLA '11.
[9] Escape Analysis for Java. Theory and Practice , 2003 .
[10] Cliff Click,et al. The java hotspot TM server compiler , 2001 .
[11] Giovanni Agosta,et al. Dynamic Look Ahead Compilation: A Technique to Hide JIT Compilation Latencies in Multicore Environment , 2009, CC.
[12] Craig Chambers,et al. Debugging optimized code with dynamic deoptimization , 1992, PLDI '92.
[13] Igor Böhm,et al. Generalized just-in-time trace compilation using a parallel task farm in a dynamic binary translator , 2011, PLDI '11.
[14] Vivek Sarkar,et al. Reducing the overhead of dynamic compilation , 2001, Softw. Pract. Exp..
[15] Amer Diwan,et al. The DaCapo benchmarks: java benchmarking development and analysis , 2006, OOPSLA '06.