Access the full text.
Sign up today, get DeepDyve free for 14 days.
Ben Lee, A. Hurson (1994)
Dataflow architectures and multithreadingComputer, 27
J. O'Connor, M. Tremblay (1997)
picoJava-I: the Java virtual machine in hardwareIEEE Micro, 17
M. El-Kharashi, F. Elguibaly, K. Li (2001)
A Java processor architecture with bytecode folding and dynamic scheduling2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233), 1
James Smith, G. Sohi (1995)
The microarchitecture of superscalar processorsProc. IEEE, 83
Tim Lindholm, Frank Yellin (1996)
The Java Virtual Machine Specification
Tetsuya Hara, H. Ando, Chikako Nakanishi, M. Nakaya (1996)
Performance Comparison of ILP Machines with Cycle Time Evaluation23rd Annual International Symposium on Computer Architecture (ISCA'96)
S. Diehl, P. Hartel, P. Sestoft (2000)
Abstract machines for programming language implementationFuture Gener. Comput. Syst., 16
K. Ebcioglu, E. Altman (1997)
Daisy: Dynamic Compilation For 10o?40 Architectural CompatibilityConference Proceedings. The 24th Annual International Symposium on Computer Architecture
(2005)
ACM SIGARCH Computer Architecture News
L. Carter, Weihaw Chuang, B. Calder (2009)
An EPIC Processor with Pending Functional Units
J. Tseng, K. Asanović (2003)
Banked multiported register files for high-frequency superscalar microprocessors30th Annual International Symposium on Computer Architecture, 2003. Proceedings.
Lee-Ren Ton, Lung-Chung Chang, Min-Fu Kao, Han-Min Tseng, Shi-Sheng Shang, Ruey-Liang Ma, Dze-Chaung Wang, C. Chung (1997)
Instruction folding in Java processorProceedings 1997 International Conference on Parallel and Distributed Systems
Abstract machines bridge the gap between a programming language and real machines. This paper proposes a general purpose tagged execution framework that may be used to construct a CPU. The CPU may accept code written in any (abstract or real) machine instruction set, and produce tagged machine code after data conflicts are resolved. This requires the construction of a tagging unit, which emulates the sequential execution of the program using tags rather than actual values. The tagged instructions are then sent to an execution engine that maps tags to values as they become available and sends ready-to-execute instructions to arithmetic units. The process of mapping tag to value may be performed using the Tomasulo scheme, or a register scheme with the result of instructions going to registers specified by their destination tags, and waiting instructions receiving operands from registers specified by their source tags.The tagged execution framework is suitable for any instruction architecture from RISC machines to stack machines. We will illustrate with an example of a Java ILP processor using a VLIW execution engine. Some related implementing issues are discussed.
ACM SIGARCH Computer Architecture News – Association for Computing Machinery
Published: Nov 1, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.