Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328471 | Computer Languages, Systems & Structures | 2013 | 19 Pages |
Abstract
We evaluate several inlining heuristics on the benchmark suites DaCapo 9.12 Bach, SPECjbb2005, and SPECjvm2008 and show that our trace-based compiler achieves an up to 51% higher peak performance than the method-based Java HotSpot client compiler. Furthermore, we show that the large compilation scope of our trace-based compiler has a positive effect on other compiler optimizations such as constant folding or null check elimination.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Christian Häubl, Christian Wimmer, Hanspeter Mössenböck,