Reducing the overhead of dynamic compilation

Krintz, Chandra; Grove, David; Sarkar, Vivek; Calder, Brad

doi:10.1002/spe.384

Cited by 44 publications

(27 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When a method is recognized as hot-spot it is pushed again into the compilation queue, even though previously compiled. This approach is similar to what described in [14].…”

Section: Hot-spots Detectionmentioning

confidence: 84%

See 1 more Smart Citation

Dynamic Look Ahead Compilation: A Technique to Hide JIT Compilation Latencies in Multicore Environment

Campanoni

Sykora

Agosta

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Object-code virtualization, commonly used to achieve software portability, relies on a virtual execution environment, typically comprising an interpreter used for initial execution of methods, and a JIT for native code generation. The availability of multiple processors on current architectures makes it attractive to perform dynamic compilation in parallel with application execution. The major issue is to decide at runtime which methods to compile ahead of execution, and how much time to invest in their optimization. This research introduces an abstract model, termed Dynamic Look Ahead (DLA) compilation, which represents the available information on method calls and computational weight as a weighted graph. The graph dynamically evolves as computation proceeds. The model is then instantiated by specifying criteria for adaptively choosing the method compilation order. The DLA approach has been applied within our dynamic compiler for .NET. Experimental results are reported and analyzed, for both synthetic programs and benchmarks. The main finding is that a careful choice of method-selection criteria, based on light-weight program analysis and execution tracing, is essential to mask compilation times and to achieve higher overall performances. On multi-processors, the DLA approach is expected to challenge the traditional virtualization environments based on bytecode interpretation and JITing, thus bridging the gap between ahead-of-time and just-in-time translation.

show abstract

“…When a method is recognized as hot-spot it is pushed again into the compilation queue, even though previously compiled. This approach is similar to what described in [14].…”

Section: Hot-spots Detectionmentioning

confidence: 84%

“…In a multiprocessor environment, the optimization time can be masked. [14] is directly related to DLA compilation. Optimization is performed on dedicated hardware, on the base of an off-line profiling phase.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Look Ahead Compilation: A Technique to Hide JIT Compilation Latencies in Multicore Environment

Campanoni

Sykora

Agosta

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…It was utilized in a number of dynamic binary translation and optimization systems [2], [3], [4], [5], [6], [7], [8]. We will refer this method as background optimization (as opposed to consequent optimization, when optimizing translation interrupts execution and utilizes processor time exclusively unless it completes).…”

Section: Introductionmentioning

confidence: 99%

Background Optimization in Full System Binary Translation

Sokolov¹,

Ermolovich²

2011

Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering

View full text Add to dashboard Cite

Abstract-Binary translation and dynamic optimization are widely used to provide compatibility between legacy and promising upcoming architectures on the level of executable binary codes. Dynamic optimization is one of the key contributors to dynamic binary translation system performance. At the same time it can be a major source of overhead, both in terms of CPU cycles and whole system latency, as long as optimization time is included in the execution time of the application under translation. One of the solutions that allow to eliminate dynamic optimization overhead is to perform optimization simultaneously with the execution, in a separate thread. In the paper we present implementation of this technique in full system dynamic binary translator. For this purpose, an infrastructure for multithreaded execution was implemented in binary translation system. This allowed running dynamic optimization in a separate thread independently of and concurrently with the main thread of execution of binary codes under translation. Depending on the computational resources available, this is achieved whether by interleaving the two threads on a single processor core or by moving optimization thread to an underutilized processor core. In the first case the latency introduced to the system by a computational intensive dynamic optimization is reduced. In the second case overlapping of execution and optimization threads also results in elimination of optimization time from the total execution time of original binary codes.

show abstract

“…Prefetching for Java has been used for improving performance in local execution contexts [7] [8]. The goal is to have classes loaded from disk into memory (or from memory to cache) before they are referenced.…”

Section: Introductionmentioning

confidence: 99%

Remote Class Prefetching: Improving Performance of Java Applications on Grid Platforms

Cardinale

Oliveira

Figueira

2006

Parallel and Distributed Processing and Applications

View full text Add to dashboard Cite

Abstract. In this paper we introduce and evaluate two prefetching techniques to improve the performance of Java applications executed on the grid. These techniques are experimentally evaluated on two grid environments, by running test applications on two different grid deployment configurations. Our testbed is suma/g, a grid platform specifically targeted at executing Java bytecode on Globus grids. The experimental results show that these techniques can be effective on improving the performance of applications run on the grid, especially for compute intensive scientific applications.

show abstract

Reducing the overhead of dynamic compilation

Abstract: The execution model for mobile, dynamically-linked, object-oriented

Cited by 44 publications

References 18 publications

Dynamic Look Ahead Compilation: A Technique to Hide JIT Compilation Latencies in Multicore Environment

Dynamic Look Ahead Compilation: A Technique to Hide JIT Compilation Latencies in Multicore Environment

Background Optimization in Full System Binary Translation

Remote Class Prefetching: Improving Performance of Java Applications on Grid Platforms

Contact Info

Product

Resources

About