• DocumentCode
    1441314
  • Title

    Stack operations folding in Java processors

  • Author

    Chang, L.-C. ; Ton, L.-R. ; Kao, M.-F. ; Chung, C.P.

  • Author_Institution
    Inst. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
  • Volume
    145
  • Issue
    5
  • fYear
    1998
  • fDate
    9/1/1998 12:00:00 AM
  • Firstpage
    333
  • Lastpage
    340
  • Abstract
    Traditionally, the performance of a stack machine has been limited by the true data dependency. A performance enhancement mechanism, stack operations folding, was used in Sun Microelectronics´ picoJava-I design, and it can fold up to 60% of all stack operations. The authors use the Java bytecode language as the target machine language, and study Java instruction folding on a proposed folding model, the POC model, which is used to illustrate the theoretical folding operations, Various practical folding strategies based on the POC model are introduced and evaluated. Statistical data show that the 4-foldable strategy eliminates 84% of all stack operations, and the 2-, 3-, and 4-foldable strategies result in overall program speedups of 1.22, 1.32 and 1.34, respectively, as compared to a stack machine without folding. Furthermore, the 4-foldable strategy is the most practical and cost effective of a Java stack machine design with a decoder width of 8 bytes. Circuit simulation results show that a 100 MHz 4-foldable folding mechanism can be realized with 0.6 μm CMOS standard cells, or 240 MHz with 0.25 μm CMOS technology
  • Keywords
    computer architecture; performance evaluation; virtual machines; Java bytecode; Java processors; data dependency; performance enhancement; stack machine; stack operations folding;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings -
  • Publisher
    iet
  • ISSN
    1350-2387
  • Type

    jour

  • DOI
    10.1049/ip-cdt:19982200
  • Filename
    728215