ACM Home Page
Please provide us with feedback. Feedback
Increasing the instruction fetch rate via multiple branch prediction and a branch address cache
Full text PdfPdf (1.13 MB)
Source International Conference on Supercomputing archive
Proceedings of the 7th international conference on Supercomputing table of contents
Tokyo, Japan
Pages: 67 - 76  
Year of Publication: 1993
ISBN:0-89791-600-X
Authors
Tse-Yu Yeh  Univ. of Michigan, Ann Arbor
Deborah T. Marr  Univ. of Michigan, Ann Arbor
Yale N. Patt  Univ. of Michigan, Ann Arbor
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 50,   Citation Count: 39
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

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

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
J. Lee and A. J. Smith, "Branch Prediction Strategies and Branch Target Buffer Deign", IEEE Computer, (Jan. 1984), pp.6-22.
3
 
4
5
6
7
8
9
10
 
11

CITED BY  39


REVIEW

"Mihail Sadeanu : Reviewer"

The authors present a hardware mechanism to predict multiple branches (MBs) and fetch multiple nonconsecutive basic blocks (MNC BB) simultaneously in each clock cycle (CC), which is viable and effective. The proposed solution fully utilizes th  more...

Collaborative Colleagues:
Tse-Yu Yeh: colleagues
Deborah T. Marr: colleagues
Yale N. Patt: colleagues