Exploiting java bytecode parallelism by enhanced POC folding model

Lee Ren Ton, Lung Chung Chang, Chung-Ping Chung

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


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.

Original languageEnglish
Title of host publicationEuro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings
EditorsArndt Bode, Thomas Ludwig, Wolfgang Karl, Roland Wismüller
PublisherSpringer Verlag
Number of pages4
ISBN (Electronic)9783540679561
StatePublished - 1 Jan 2000
Event6th International European Conference on Parallel Computing, Euro-Par 2000 - Munich, Germany
Duration: 29 Aug 20001 Sep 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International European Conference on Parallel Computing, Euro-Par 2000

Fingerprint Dive into the research topics of 'Exploiting java bytecode parallelism by enhanced POC folding model'. Together they form a unique fingerprint.

Cite this