An information-theoretic look at branch-prediction
Conference
·
OSTI ID:7222477
- Lawrence Livermore National Lab., CA (USA)
Accurate branch-prediction is necessary to utilize deeply pipelined and Very Long Instruction-Word (VLIW) architectures. For a set of program traces we show the upper limits on branch predictability, and hence machine utilization, for important classes of branch-predictors using static (compiletime) and dynamic (runtime) program information. A set of optimal superpredictors'' is derived from these program traces. These optimal predictors compare favorably with other proposed methods of branch-prediction. 11 refs., 5 figs., 11 tabs.
- Research Organization:
- Lawrence Livermore National Lab., CA (USA)
- Sponsoring Organization:
- CAU; DOD; DOE/ER; NSF; STOFCA
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 7222477
- Report Number(s):
- UCRL-101868; CONF-900564--1; ON: DE90001170; CNN: CCR-8812843; DAAG29-85-K-0070; N00039-84-C-0089
- Country of Publication:
- United States
- Language:
- English
Similar Records
An information-theoretic look at branch-prediction
Bulldog: a compiler for VLIW architectures
Toward improved branch prediction through data mining.
Technical Report
·
Tue Sep 11 00:00:00 EDT 1990
·
OSTI ID:6569918
Bulldog: a compiler for VLIW architectures
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5724953
Toward improved branch prediction through data mining.
Technical Report
·
Tue Sep 01 00:00:00 EDT 2009
·
OSTI ID:993886