A Tree-Based Alternative to Java Byte-Codes (prepub) (1996)
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Thomas Kistler and Michael Franz},
title = {A Tree-Based Alternative to Java Byte-Codes (prepub)},
institution = {International Journal of Parallel Programming},
year = {1996}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
. Despite the apparent success of the Java Virtual Machine, its lackluster performance makes it ill-suited for many speed-critical applications. Although the latest just-in-time compilers and dedicated Java processors try to remedy this situation, optimized code compiled directly from a C program source is still considerably faster than software transported via Java byte-codes. This is true even if the Java byte-codes are subsequently further translated into native code. In this paper, we claim that these performance penalties are not a necessary consequence of machine-independence, but related to Java's particular intermediate representation and runtime architecture. We have constructed a prototype and are further developing a software transportability scheme founded on a tree-based alternative to Java bytecodes. This tree-based intermediate representation is not only twice as compact as Java byte-codes, but also contains more high-level information, some of which is cri...
