Fast, effective code generation in a just-in-time Java compiler

Adl-Tabatabai, Ali-Reza; Cierniak, Michał; Lueh, Guei-Yuan; Parikh, Vishesh M.; Stichnoth, James M.

doi:10.1145/277652.277740

Cited by 39 publications

(47 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Average column shows the speedup obtained on average when using IBLO 1 is achieved. Given the small standard deviation of performance (as shown in the SD column), this demonstrates that a learning technique that selects an optimisation based on prior knowledge is capable of delivering consistent performance improvement.…”

Section: Linuxmentioning

confidence: 99%

Adaptive java optimisation using instance-based learning

Long

O’Boyle

2004

Proceedings of the 18th Annual International Conference on Supercomputing

View full text Add to dashboard Cite

This paper describes a portable, machine learning-based approach to Java optimisation. This approach uses an instancebased learning scheme to select good transformations drawn from Pugh's Unified Transformation Framework [11]. This approach was implemented and applied to a number of numerical Java benchmarks on two platforms. Using this scheme, we are able to gain over 70% of the performance improvement found when using an exhaustive iterative search of the best compiler optimisations. Thus we have a scheme that gives a high level of portable performance without any excessive compilations.

show abstract

Section: Linuxmentioning

confidence: 99%

Adaptive java optimisation using instance-based learning

Long

O’Boyle

2004

Proceedings of the 18th Annual International Conference on Supercomputing

View full text Add to dashboard Cite

show abstract

“…Current technologies such as JIT (just-in-time) compilers [2] are improving the per- (call and return). The performance figures are taken from the papers of LRPC [3], Spring [8], anonymous RPC [25], and L4 [15].…”

Section: Methodsmentioning

confidence: 99%

Efficient kernel support of fine-grained protection domains for mobile code

Takahashi

Kono

Masuda

Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003)

View full text Add to dashboard Cite

Mobile code is an emerging paradigm of distributed computing. It roams over a network, is linked with an application, and runs as a part of an application. In the case of web browsers, it is commonplace to download a mobile code, called a plug-in, from a truly open network such as Internet. Owning to the anonymity of an open network, the mobile code may be malicious; thus, it is indispensable to protect local computing resources from attacks by the malicious code. We have developed a kernel that supports fine-grained protection domains that preclude mobile code from making unauthorized accesses to the local resources. The developed scheme provides a novel mechanism, called a multiprotection page table, of virtual memory for creating finegrained protection domains. The multi-protection page table enables efficient cross-domain calls, whereas it provides protection. Experimental results show that the developed scheme incurs only a 5.9% execution overhead even if crossdomain calls occur 30,000 times per second.

show abstract

“…Adl-Tabatabai and others [1] describe a fast and effective code generation system for a JIT compiler. This compiler does optimizations like bound check elimination, common subexpression elimination and two kinds of register allocation, a simple one and a global priority based one.…”

Section: Previous Workmentioning

confidence: 99%

Efficient JavaVM just-in-time compilation

Krall

Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192)

View full text Add to dashboard Cite

Conventional compilers are designed for producing highly optimized code without paying much attention to compile time. The design goals of Java just-in-time compilers are different: produce fast code at the smallest possible compile time. In this article we present a very fast algorithm for translating JavaVM byte code to high quality machine code for RISC processors. This algorithm handles combines instructions, does copy elimination and coalescing and does register allocation. It comprises three passes: basic block determination, stack analysis and register preallocation, final register allocation and machine code generation. This algorithm replaces an older one in the CACAO JavaVM implementation reducing the compile time by a factor of seven and producing slightly faster machine code. The speedup comes mainly from following simplifications: fixed assignment of registers at basic block boundaries, simple register allocator, better exception handling, better memory management and fine tuning the implementation. The CACAO system is currently faster than every JavaVM implementation for the Alpha processor and generates machine code for all used methods of the javac compiler and its libraries in 60 milliseconds on an Alpha workstation.

show abstract

Fast, effective code generation in a just-in-time Java compiler

Cited by 39 publications

References 11 publications

Adaptive java optimisation using instance-based learning

Adaptive java optimisation using instance-based learning

Efficient kernel support of fine-grained protection domains for mobile code

Efficient JavaVM just-in-time compilation

Contact Info

Product

Resources

About