Loading...
Please wait, while we are loading the content...
Similar Documents
Java Annotation-Aware Just-In-Time (AJIT) Compilation System (1999)
| Content Provider | CiteSeerX |
|---|---|
| Author | Azevedo, Ana Nicolau, Alex Hummel, Joe |
| Description | In Proceedings of the ACM 1999 Conference on Java Grande |
| Abstract | The Java Bytecode language lacks expressiveness for traditional compiler optimizations, making this portable, secure software distribution format inefficient as a program representation for high performance. This inefficiency results from the underlying stack model, as well as the fact that many bytecode operations intrinsically include sub-operations (e.g., iaload includes the address computation, array bounds checks and the actual load of the array element). The stack model, with no operand registers and limiting access to the top of the stack, prevents the reuse of values and bytecode reordering. In addition, the bytecodes have no mechanism to indicate which sub-operations in the bytecode stream are redundant or subsumed by previous ones. As a consequence, the Java Bytecode language inhibits the expression of important compiler optimizations, including common sub-expression elimination, register allocation and instruction scheduling. The bytecode stream generated by the Java front... |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Java Bytecode Language Many Bytecode Operation Instruction Scheduling Secure Software Distribution Format Inefficient Previous One Array Bound Check Stack Model Register Allocation Actual Load Important Compiler Optimization Bytecode Reordering Java Annotation-aware Just-in-time Program Representation Array Element Java Front Inefficiency Result Traditional Compiler Optimization Common Sub-expression Elimination Compilation System Address Computation Bytecode Stream Operand Register |
| Content Type | Text |
| Resource Type | Proceeding Conference Proceedings |
