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. The architecture provides dual processing capability to execute Java bytecodes as well as other native binaries. Bytecode processing in various stages of the instruction pipeline is discussed and analyzed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
El-Kharashi, M.W., Gebali, F., Li, K.F. (2002). Stack Dependency Resolution for Java Processors Based on Hardware Folding and Translation. In: Narayanan, V., Wolczko, M.I. (eds) Java Microarchitectures. The Springer International Series in Engineering and Computer Science, vol 679. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0993-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0993-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5341-6
Online ISBN: 978-1-4615-0993-6
eBook Packages: Springer Book Archive