A brief history of just-in-time

Aycock, John

doi:10.1145/857076.857077

Cited by 234 publications

(145 citation statements)

References 65 publications

Supporting

Mentioning

143

Contrasting

Unclassified

Order By: Relevance

“…To our knowledge, this is also the first time that lazy compilation (as an instance of just-in-time compilation [3]) is used in the context of logic programming, in particular for queries.…”

Section: Discussionmentioning

confidence: 93%

“…In [3], lazy compilation is identified as a kind of just-in-time (JIT) compilation or dynamic compilation, which is characterized as translation which occurs after a program begins execution. In this paper, we present lazy variants of control flow compilation.…”

Section: Technologymentioning

confidence: 99%

“…In this paper, we present lazy variants of control flow compilation. The requirement in [3] that the compiler used for JIT compilation should be fast enough is satisfied by our control flow compiler. Our lazy variant implicitly calls the control flow compiler when execution reaches a part of the query that is not yet compiled.…”

Section: Technologymentioning

confidence: 99%

See 2 more Smart Citations

Fast Query Evaluation with (Lazy) Control Flow Compilation

2004

View full text Add to dashboard Cite

Abstract. Learning algorithms such as decision tree learners dynamically generate a huge amount of large queries. Because these queries are executed often, the trade-off between meta-calling and compiling & running them has been in favor of the latter, as compiled code is faster. This paper presents a technique named control flow compilation, which improves the compilation time of the queries by an order of magnitude without reducing the performance of executing the queries. We exploit the technique further by using it in a just-in-time manner. This improves performance in two ways: it opens the way to incremental compilation of the generated queries, and also gives potentially large gains by never compiling dynamically unreachable code. Both the implementation of (lazy) control flow compilation and its experimental evaluation in a real world application are reported on.

show abstract

Section: Discussionmentioning

confidence: 93%

Section: Technologymentioning

confidence: 99%

See 1 more Smart Citation

Fast Query Evaluation with (Lazy) Control Flow Compilation

2004

View full text Add to dashboard Cite

show abstract

“…A wide survey of Just in Time (JIT) and Ahead of Time (AOT) compilation can be found in [3] and [21].…”

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

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

“…Moreover, the VM has to be ported to each new platform. To improve on these, solutions like JITs [3] and customized VMs for embedded platforms [15] have been proposed. In the template based OS generation, a custom OS is generated from a generic library of templates [6][7] [14].…”

Section: Introductionmentioning

confidence: 99%

Code partitioning for synthesis of embedded applications with phantom

Nácul¹,

Givargis²

IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.

View full text Add to dashboard Cite

In a large class of embedded systems, dynamic multitasking using traditional OS techniques is infeasible because of memory and processing overheads or lack of operating systems availability for the target embedded processor. Serializing compilers have been proposed as an alternative solution, enabling a designer to develop multitasking applications without the need of OS support. A serializing compiler is a source-to-source translator that takes a POSIX compliant multitasking C program as input and generates an equivalent, embedded processor independent, singlethreaded ANSI C program, to be compiled using the embedded processor-specific tool chain. Such serializing compilers work by partitioning each task into blocks of code and synthesizing a scheduler that dynamically switches among these blocks. The quality of the compiled code in terms of multitasking overhead and task latency is highly dependent on the partitioning algorithm. In this work, we give our solution to the partitioning problem in the context of serializing compilers. We show that it is possible to provide the designer with a set of Pareto-Optimal solutions that trade off multitasking overhead for task latency.

show abstract

A brief history of just-in-time

Cited by 234 publications

References 65 publications

Fast Query Evaluation with (Lazy) Control Flow Compilation

Fast Query Evaluation with (Lazy) Control Flow Compilation

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

Code partitioning for synthesis of embedded applications with phantom

Contact Info

Product

Resources

About