DocumentCode
772456
Title
Optimal 2-bit branch predictors
Author
Nair, Ravi
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
44
Issue
5
fYear
1995
fDate
5/1/1995 12:00:00 AM
Firstpage
698
Lastpage
702
Abstract
This paper presents an efficient technique to analyze finite-state machines to determine an optimal one for branch prediction. It also presents results from using this technique to determine optimal 4-state branch predictors for applications in the SPECS9 benchmark suite running on the IBM RS/6000. The paper concludes that the simple 2-bit counter is the only machine that performs consistently well and close to the optimal over all applications
Keywords
finite state machines; performance evaluation; 2-bit branch predictors; IBM RS/6000; SPECS9 benchmark suite; branch instructions; branch prediction; dynamic branch prediction; finite-state machines; trace analysis; Application software; Clocks; Costs; Counting circuits; Degradation; Hardware; History; Pattern analysis; Performance analysis;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.381956
Filename
381956
Link To Document