Adapting Tomasulo's algorithm for bytecode folding based Java processors
Mohamed Watheq El-Kharashi, F. El-Guibaly, Kin F. Li · ACM SIGARCH Computer Architecture News · 2001
A novel processor architecture for hardware execution of Java bytecodes is presented. Stack dependency is resolved by the use of a hardware bytecode folding algorithm coupled with Tomasulo's scheduling algorithm. In this paper, we present a framework for adapting Tomasulo's algorithm for bytecode folding based Java processors. We discuss a set of architectural features that are tailored for Java execution as well as for general-purpose Java-independent codes. A comprehensive example is included to illustrate these features graphically.