An analytical POC stack operations folding for continuous and discontinuous Java bytecodes
Journal of Systems Architecture: the EUROMICRO Journal
Java Bytecode Optimization with Advanced Instruction Folding Mechanism
ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Embedded Processor Design Challenges: Systems, Architectures, Modeling, and Simulation - SAMOS
Exploiting Java Bytecode Parallelism by Enhanced POC Folding Model (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Embedded processor design challenges
An Advanced Instruction Folding Mechanism for a Stackless Java Processor
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
High performance annotation-aware JVM for Java cards
Proceedings of the 5th ACM international conference on Embedded software
ACM SIGARCH Computer Architecture News - Special issue: dasCMP'05
Exploiting an abstract-machine-based framework in the design of a Java ILP processor
Journal of Systems Architecture: the EUROMICRO Journal
An instruction folding solution to a java processor
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
Traditionally, the performance of a stack machine was limited by the true data dependency. A performance enhancement mechanism - Stack Operations Folding - was used in Sun Microelectronics picoJava design [1][2] and it can reduce up to 60% of all stack operations. In this paper, we use the Java bytecode language as the target machine language, and study its instruction folding on a proposed machine model.Three folding strategies: 2-foldable, 3-foldable and 4-foldable, were simulated and evaluated. Statistical data show that our third folding strategy eliminates 73% of all stack operations, and each strategy has an overall program speedup of 1.19, 1.25 and 1.26, respectively, as compared to a traditional stack machine. Moreover, a Java machine model suitable for instruction folding, together with its pipeline stages, are presented. It seems to have the best cost/performance effectiveness of a Java stack machine if six bytes decoder width and the second folding strategy -- the three-foldable strategy -- are adopted.