A Tree-Based Alternative to Java Byte-Codes
Saved in:
| Title: | A Tree-Based Alternative to Java Byte-Codes |
|---|---|
| Authors: | Thomas Kistler, Michael Franz |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://www.ics.uci.edu/~franz/pubs-pdf/C05.pdf. |
| Publication Year: | 1997 |
| Collection: | CiteSeerX |
| Description: | 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 orders of magnitude faster than software transported via Javabyte-codes. This is true even if the Javabyte-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. Wehave constructed a prototype and are further developing a software transportabilityscheme founded on a tree-based alternativetoJavabyte-codes. This tree-based intermediate representation is not only twice as compact as Javabyte-codes, but also contains more detailed semantic information, some of whichiscritical for advanced c. |
| Document Type: | text |
| File Description: | application/pdf |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2124 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2124 http://www.ics.uci.edu/~franz/pubs-pdf/C05.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.F1D925E3 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | 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 orders of magnitude faster than software transported via Javabyte-codes. This is true even if the Javabyte-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. Wehave constructed a prototype and are further developing a software transportabilityscheme founded on a tree-based alternativetoJavabyte-codes. This tree-based intermediate representation is not only twice as compact as Javabyte-codes, but also contains more detailed semantic information, some of whichiscritical for advanced c. |
|---|