ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Optimization of instruction fetch mechanisms for high issue rates
Full text PdfPdf (1.19 MB)
Source International Symposium on Computer Architecture archive
Proceedings of the 22nd annual international symposium on Computer architecture table of contents
S. Margherita Ligure, Italy
Pages: 333 - 344  
Year of Publication: 1995
ISBN:0-89791-698-0
Also published in ...
Authors
Thomas M. Conte  Computer Architecture Research Laboratory, Department of Electrical and Computer Engineering, University of South Carolina, Columbia, South Carolina
Kishore N. Menezes  Computer Architecture Research Laboratory, Department of Electrical and Computer Engineering, University of South Carolina, Columbia, South Carolina
Patrick M. Mills  Computer Architecture Research Laboratory, Department of Electrical and Computer Engineering, University of South Carolina, Columbia, South Carolina
Burzin A. Patel  Computer Architecture Research Laboratory, Department of Electrical and Computer Engineering, University of South Carolina, Columbia, South Carolina
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 39,   Citation Count: 46
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Recent superscalar processors issue four instructions per cycle. These processors are also powered by highly-parallel superscalar cores. The potential performance can only be exploited when fed by high instruction bandwidth. This task is the responsibility of the instruction fetch unit. Accurate branch prediction and low I-cache miss ratios are essential for the efficient operation of the fetch unit. Several studies on cache design and branch prediction address this problem. However, these techniques are not sufficient. Even in the presence of efficient cache designs and branch prediction, the fetch unit must continuously extract multiple, non-sequential instructions from the instruction cache, realign these in the proper order, and supply them to the decoder. This paper explores solutions to this problem and presents several schemes with varying degrees of performance and cost. The most-general scheme, the collapsing buffer, achieves near-perfect performance and consistently aligns instructions in excess of 90% of the time, over a wide range of issue rates. The performance boost provided by compiler optimization techniques is also investigated. Results show that compiler optimization can significantly enhance performance across all schemes. The collapsing buffer supplemented by compiler techniques remains the best-performing mechanism. The paper closes with recommendations and suggestions for future.


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
L. Gwennap, "MIPS RI0000 uses decoupled architecture," Microprocessor Report, Oct. 1994.
 
2
A. Agarwal, "UltraSPARC: A new era in SPARC performance," in 1994 M, croprocessor Forum Pro. ceedings, Oct. 1994.
 
3
M. Slater, "AMD's K5 designed to outrun Pentium," Microprocessor Report, Oct. 1994.
4
5
6
7
8
 
9
10
 
11
S. McFarling, "Combining branch predictors," WRL Technical Note TN-36, Digital Equipment Corporation, 1993.
 
12
L. Gwennap, "PA-8000 combines complexity and speed," Microprocessor Report, Nov. 1994.
 
13
 
14
 
15
S. P. Song and M. Denman, "The PowerPC 604 RISC microprocessor," tech. rep., Somerset Design Center, Austin, TX, Apr. 1994.
 
16
M. Johnson, Superscalar microprocessor design. Englewood Cliffs, NJ: Prentice-Hail, 1991.
 
17
J. A. Fisher, "Trace scheduling: A technique for global microcode compaction," IEEE Trans. Cornput., vol. C-30, no. 7, pp. 478-490, July 1981.
 
18
 
19
 
20
21

CITED BY  46

Collaborative Colleagues:
Thomas M. Conte: colleagues
Kishore N. Menezes: colleagues
Patrick M. Mills: colleagues
Burzin A. Patel: colleagues