The Open Runtime Platform: a flexible high‐performance managed runtime environment

Cierniak, Michał; Eng, Marsha; Glew, Neal; Lewis, Brian T. R.; Stichnoth, James M.

doi:10.1002/cpe.852

Cited by 28 publications

(34 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The IBM Mixed-mode interpreter system also relies on invocation counts to determine recompilation decisions [37]. In addition to a counter-based selective optimization heuristics, Intel's ORP JVM [13] also uses a count-down scheme to identify hot methods.…”

Section: Related Workmentioning

confidence: 99%

Phase-based adaptive recompilation in a JVM

Verbrugge

2008

Proceedings of the 6th Annual IEEE/ACM International Symposium on Code Generation and Optimization

View full text Add to dashboard Cite

Modern JIT compilers often employ multi-level recompilation strategies as a means of ensuring the most used code is also the most highly optimized, balancing optimization costs and expected future performance. Accurate selection of code to compile and level of optimization to apply is thus important to performance. In this paper we investigate the effect of an improved recompilation strategy for a Java virtual machine. Our design makes use of a lightweight, low-level profiling mechanism to detect high-level, variable length phases in program execution. Phases are then used to guide adaptive recompilation choices, improving performance. We develop both an offline implementation based on trace data and a self-contained online version. Our offline study shows an average speedup of 8.7% and up to 21%, and our online system achieves an average speedup of 4.4%, up to 18%. We subject our results to extensive analysis and show that our design achieves good overall performance with high consistency despite the existence of many complex and interacting factors in such an environment.

show abstract

Section: Related Workmentioning

confidence: 99%

Phase-based adaptive recompilation in a JVM

Verbrugge

2008

Proceedings of the 6th Annual IEEE/ACM International Symposium on Code Generation and Optimization

View full text Add to dashboard Cite

show abstract

“…In IBM's J9 [19] as well as in Intel's ORP [6] virtual machines there are parallel threads to perform code compilation and execution tasks.…”

Section: Related Workmentioning

confidence: 99%

A parallel dynamic compiler for CIL bytecode

2008

View full text Add to dashboard Cite

Multi-core technology is being employed in most recent high-performance architectures. Such architectures need specifically designed multi-threaded software to exploit all the potentialities of their hardware parallelism.At the same time, object code virtualization technologies are achieving a growing popularity, as they allow higher levels of software portability and reuse.Thus, a virtual execution environment running on a multi-core processor has to run complex, high-level applications and to exploit as much as possible the underlying parallel hardware. We propose an approach that leverages on CMP features to expose a novel pipeline synchronization model for the internal threads of the dynamic compiler.Thanks to compilation latency masking effect of the pipeline organization, our dynamic compiler, ILDJIT, is able to achieve significant speedups (26% on average) with respect to the baseline, when the underlying hardware exposes at least two cores.

show abstract

“…In more detail, patching (used for example by Ishizaki et al [9] and in ORP [2,3]) is a form of in-place code modification for reverting to unoptimised code that works as follows. The invocation x.m() that is currently monomorphic (calling say C::m) is compiled to code like the following:…”

Section: Dynamic Class Loadingmentioning

confidence: 99%

Method Inlining, Dynamic Class Loading, and Type Soundness.

Glew

Palsberg

2005

JOT

Self Cite

View full text Add to dashboard Cite

Method inlining is an optimisation that can be invalidated by later class loading. A program analysis based on the current loaded classes might determine that a method call has a unique target, but later class loading could add targets. If a compiler speculatively inlines methods based on current information, then it will have to undo the inlining when later classes invalidate the assumptions. The problem with undoing inlining is that the optimised code might be executing at the time of undo and therefore require a complicated, on-the-fly update of the program state. Previous work presented techniques for dealing with invalidation including on-stack replacement, preexistence analysis, extant analysis, and code patching. Until now, it has been an open question whether such operations can be done in a type-safe manner, and no formal proof of correctness exists in the literature. In this paper we present a framework for reasoning about method inlining, dynamic class loading, and type soundness. Our example language has both a nonoptimising and an optimising semantics. At the point of dynamically loading a class, the optimising semantics does a whole-program analysis, inlines calls in the newly loaded code, and patches the invalidated inlinings in all previously loaded code. The patching is based on a new construct that models in-place update of machine code-a technique used by some virtual machines to do speculative method inlining. The two semantics are equivalent and both have a type soundness property-proving correctness and type safety of the optimisation. Our framework can form the basis of virtual machines that represent optimised code in a typed low-level language.

show abstract

The Open Runtime Platform: a flexible high‐performance managed runtime environment

Cited by 28 publications

References 13 publications

Phase-based adaptive recompilation in a JVM

Phase-based adaptive recompilation in a JVM

A parallel dynamic compiler for CIL bytecode

Method Inlining, Dynamic Class Loading, and Type Soundness.

Contact Info

Product

Resources

About