DocumentCode
2220391
Title
Cost-effective graceful degradation in speculative processor subsystems: the branch prediction case
Author
Almukhaizim, Sobeeh ; Verdel, Thomas ; Makris, Yiorgos
Author_Institution
Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA
fYear
2003
fDate
13-15 Oct. 2003
Firstpage
194
Lastpage
197
Abstract
We analyze the effect of errors in branch predictors, a representative example of speculative processor subsystems, to motivate the necessity for fault tolerance in such subsystems. We also describe the design of fault tolerant branch predictors using general fault tolerance techniques. We then propose a fault-tolerant implementation that utilizes the finite state machine (FSM) structure of the pattern history table (PHT) and the set of potential faulty states to predict the branch direction, yet without strictly identifying the correct state. The proposed solution provides virtually the same prediction accuracy as general fault tolerant techniques, while significantly reducing the incurred hardware overhead.
Keywords
decision tables; fault tolerant computing; finite state machines; parallel architectures; FSM; PHT; fault tolerant branch predictor; finite state machine; pattern history table; speculative processor subsystem; Accuracy; Computer aided software engineering; Counting circuits; Degradation; Fault diagnosis; Fault tolerance; Hardware; History; Logic circuits; System performance;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Design, 2003. Proceedings. 21st International Conference on
ISSN
1063-6404
Print_ISBN
0-7695-2025-1
Type
conf
DOI
10.1109/ICCD.2003.1240894
Filename
1240894
Link To Document