ACM Home Page
Please provide us with feedback. Feedback
A fill-unit approach to multiple instruction issue
Full text PdfPdf (993 KB)
Source International Symposium on Microarchitecture archive
Proceedings of the 27th annual international symposium on Microarchitecture table of contents
San Jose, California, United States
Pages: 162 - 171  
Year of Publication: 1994
ISBN:0-89791-707-3
Authors
Manoj Franklin  Dept. of Elect. and Computer Eng., Clemson University, Clemson, SC
Mark Smotherman  Dept. of Computer Science, Clemson University, Clemson, SC
Sponsors
IEEE-CS\TCMM : TC on Microprocessors & Microcomputers
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 19,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/192724.192748
What is a DOI?

ABSTRACT

Multiple issue of instructions occurs in superscalar and VLIW machines. This paper investigates a third type of machine design, which combines the advantages of code compatibility as in superscalars and the absence of complex dependency-checking logic from the decoder as in VLIW. In this design, a stream of scalar instructions is executed by the hardware and is simultaneously compacted into VLIW-type instructions, which are then stored in a structure called a shadow cache. When a shadow cache line contains the instructions requested by the fetch unit, the scalar instruction stream is preempted and all operations in the shadow cache line are simultaneously issued and executed. The mechanism that compacts instructions is called a fill unit, and was first proposed for dynamically compacting microoperations into large executable units by Melvin, Shebanow, and Patt in 1988. We have extended their approach to directly handle data dependencies, delayed branches, and speculative execution (using branch prediction). This approach is evaluated using the MIPS architecture, and a six-functional-unit machine is found to be 52 to 108% faster than a single-issue processor for unrecompiled SPECint92 benchmarks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
K. Ebcioglu, "Some Design Ideas for a VLIW Architecture for Sequential Natured Software," in M. Cosnard, et al., (eds.), Parallel Processing (Proc. IFiP WG 10.3 Working Conference on Parallel Processing, Pisa, Italy), North Holland, 1988, pp. 3-21.
 
5
 
6
 
7
M. Johnson, $uperscalar Microprocessor Design. Englewood Cliffs, NJ: Prentice-Hall, 1991.
 
8
9
 
10
 
11
 
12
 
13
14

CITED BY  22
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Manoj Franklin: colleagues
Mark Smotherman: colleagues

Peer to Peer - Readers of this Article have also read: