Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Exploiting Java Bytecode Parallelism by Enhanced POC Folding Model
| |
|
Exploiting Java Bytecode Parallelism by Enhanced POC Folding Model
Lee-Ren Ton5 , Lung-Chung Chang6 and Chung-Ping Chung5 
| (5) |
Department of Computer Science and Information Engineering, National Chiao Tung University, No. 1001, Dashiue Rd., Hsinchu, Taiwan 30056, ROC |
| (6) |
Computer & Communications Research Laboratories, Industrial Technology Research Institute, Building 51, No. 195-11, Sec. 4, Jungshing Rd., Judung Jen, Hsinchu, Taiwan 31041, ROC |
Abstract
Instruction-level parallelism of stack codes like Java is severely limited by accessing the operand stack sequentially. To
resolve this problem in Java processor design, our earlier works have presented stack operations folding to reduce the number
of push/pop operations in between the operand stack and the local variable. In those studies, Java bytecodes are classified
into three major POC types. Statistical data indicates that the 4-foldable strategy of the POC folding model can eliminate
86% of push/pop operations. In this research note, we propose an Enhanced POC (EPOC) folding model to eliminate more than
99% of push/pop operations with an instruction buffer size of 8 bytes and the same 4-foldable strategy. The average issued
instructions per cycle for a single pipelined architecture is further enhanced from 1.70 to 1.87.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|