Adapting Tomasulo's Algorithm for Bytecode Folding Based Java Processors M. Watheq E1-Kharashi, Fayez Elguibaly, and Kin E Li DeparanexttofElearical and ComputerEngineering,UniversityofVictoria. F_,mail:(watheq,fayez,kinli}(~ECE.UVig.CA Abstract-- A novel processor wr.hiteclurefor hardware ex~ffon of Java bytecodes is prexente.~ Stack dependency is reaolvedby the use of a hardwarebytecode folding algorithm coupled with Tomasulo'ssct~duling algorithm. In thiapaper, we present afrnmework for adapting Tomasulo"salgorithmfor bytecodefolding based Java pmce.ssors. Wediscusj a set of architecluraifealums that are tailoredfor Java erecution as well asfor general-purposeJava.independent codes. A comprehensive example is included to illustrate thesefealureJ graphically. of the proposed processor architecture. Section III briefly surveys related background materials. Proposed Java-dependent features are discussed in Section IV, whereas Java-independent features are examined in Section V. Section VI illustrates our architecture with a comprehensive example. The paper concludes in Section VII. II. PROPOSED ARCHITECTUREOVERVIEW Our architecture employs a deep and dynamic instruction pipeline that provides high throughput and efficient ILP. Design objectives that characterize this pipeline are: (I) OPEX bytecode folding to provide a stackless venue for executing stack based JBCs; (2) dynamic binary translation of folding groups to permit JBC processing using a RISC core; (3) dynamic Tomasulo's hardware to facilitate runtime optimization and scheduling; and (4) deep pipelining to
/lp/association-for-computing-machinery/adapting-tomasulo-s-algorithm-for-bytecode-folding-based-java-jWPZh07k7w