DocumentCode
2262456
Title
Multiple branch and block prediction
Author
Wallace, Steven ; Bagherzadeh, Nader
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA
fYear
1997
fDate
1-5 Feb 1997
Firstpage
94
Lastpage
103
Abstract
Accurate branch prediction and instruction fetch prediction of a microprocessor are critical to achieve high performance. For a processor which fetches and executes multiple instructions per cycle, an accurate and high bandwidth instruction fetching mechanism becomes increasingly important to performance. Unfortunately, the relatively small basic block size exhibited in many general-purpose applications severely limits instruction fetching. In order to achieve a high fetching rate for wide-issue superscalars, a scalable method to predict multiple branches per block of sequential instructions is presented. Its accuracy is equivalent to a scalar two-level adaptive prediction. Also, to overcome the limitation imposed by control transfers, a scalable method to predict multiple blocks is presented. As a result, a two black, multiple branch prediction mechanism for a block width of 8 instructions achieves an effective fetching rate of 8 instructions per cycle on the SPEC95 benchmark suite
Keywords
computer architecture; instruction sets; microprocessor chips; SPEC95 benchmark suite; instruction fetch prediction; instruction fetching; instruction fetching mechanism; microprocessor; multiple branch and block prediction; Accuracy; Bandwidth; Costs; Decoding; History; Microprocessors; Parallel processing; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
High-Performance Computer Architecture, 1997., Third International Symposium on
Conference_Location
San Antonio, TX
Print_ISBN
0-8186-7764-3
Type
conf
DOI
10.1109/HPCA.1997.569645
Filename
569645
Link To Document