Optimized interval splitting in a linear scan register allocator

Proceedings of the First ACM/USENIX International Conference on Virual Execution Environments, VEE 05

Volumn , Issue , 2005, Pages 132-141

  Wimmer, Christian ^a   Mössenböck, Hanspeter ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Compilers; Graph coloring; Java; Just in time compilation; Linear scan; Optimization; Register allocation

Indexed keywords

ALGORITHMS; BENCHMARKING; GRAPH THEORY; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; PROGRAM COMPILERS;

GRAPH-COLORING; JUST-IN-TIME COMPILATION; LINEAR SCAN; REGISTER ALLOCATION;

STORAGE ALLOCATION (COMPUTER);

EID: 32044448327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064979.1064998     Document Type: Conference Paper

References (18)

1. P. Briggs, K. D. Cooper, and L. Torczon. Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems, 16(3):428-455, 1994.
2. G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins, and P. W. Markstein. Register allocation via coloring. Computer Languages, 6:47-57, 1981.
3. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, 1991.
4. R. Griesemer and S. Mitrovic. A compiler for the Java HotSpot™ virtual machine. In L. Böszörmenyi, J. Gutknecht, and G. Pomberger, editors, The School of Niklaus Wirth: The Art of Simplicity, pages 133-152. dpunkt.verlag, 2000.
5. Institute of Electrical and Electronics Engineers. IEEE Standard for Binary Floating-Point Arithmetic. ANSI/IEEE Standard 754-1985.
6. Intel Corporation. IA-32 Intel Architecture Software Developer's Manual, Volume 1: Basic Architecture, 2004. Order Number 253665.
7. T. Kotzmann and H. Mössenböck. Escape analysis in the context of dynamic compilation and deoptimization. In Proceedings of the First Conference on Virtual Execution Environments, 2005.
8. H. Mössenböck. Adding static single assignment form and a graph coloring register allocator to the Java HotSpot™ client compiler. Technical Report 15, Institute for Practical Computer Science, Johannes Kepler University Linz, 2000.
9. H. Mössenböck and M. Pfeiffer. Linear scan register allocation in the context of SSA form and register constraints. In Proceedings of the 11th International Conference on Compiler Construction, pages 229-246, 2002.
10. TM server compiler. In Proceedings of the Java Virtual Machine Research and Technology Symposium, 2001.
11. J. Park and S.-M. Moon. Optimistic register coalescing. ACM Transactions on Programming Languages and Systems, 26(4):735-765, 2004.
12. M. Poletto, D. R. Engler, and M. F. Kaashoek. tec: A system for fast, flexible, and high-level dynamic code generation. In Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, pages 109-121. ACM Press, 1997.
13. M. Poletto and V. Sarkar. Linear scan register allocation. ACM Transactions on Programming Languages and Systems, 21(5):895-913, 1999.
14. R. Pozo and B. Miller. SciMark 2.0. http://math.nist.gov/scimark2/.
15. Standard Performance Evaluation Corporation. SPECjvm98. http://www.spec.org/jvm98/.
16. TM Virtual Machine, v 1.4.1, 2002. http://java.sun.com/products/hotspot.
17. O. Traub, G. Holloway, and M. D. Smith. Quality and speed in linear-scan register allocation. In Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, pages 142-151. ACM Press, 1998.
18. TM client compiler. Master's thesis, Johannes Kepler University Linz, 2004.