Exploiting Java Bytecode Parallelism by Enhanced POC Folding Model

  • Lee-Ren Ton
  • Lung-Chung Chang
  • Chung-Ping Chung
Conference paper

DOI: 10.1007/3-540-44520-X_141

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1900)
Cite this paper as:
Ton LR., Chang LC., Chung CP. (2000) Exploiting Java Bytecode Parallelism by Enhanced POC Folding Model. In: Bode A., Ludwig T., Karl W., Wismüller R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Lee-Ren Ton
    • 1
  • Lung-Chung Chang
    • 2
  • Chung-Ping Chung
    • 1
  1. 1.Department of Computer Science and Information EngineeringNational Chiao Tung UniversityHsinchuTaiwan 30056, ROC
  2. 2.Computer & Communications Research LaboratoriesIndustrial Technology Research InstituteHsinchuTaiwan 31041, ROC

Personalised recommendations