Adapting Tomasulo's algorithm for bytecode folding based Java processors

  • Authors:
  • M. Watheq El-Kharashi;Fayez Elguibaly;Kin F. Li

  • Affiliations:
  • University of Victoria;University of Victoria;University of Victoria

  • Venue:
  • ACM SIGARCH Computer Architecture News - Special Issue: PACT 2001 workshops
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.