Conference paper
Constraint graph analysis of multithreaded programs
H.W. Cain, M.H. Lipasti, et al.
PACT 2003
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 SPEC89 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. © 1995 IEEE
H.W. Cain, M.H. Lipasti, et al.
PACT 2003
Ravi Nair, Se June Hong, et al.
DAC 1982
Harold W. Cain, Mikko H. Lipasti, et al.
Journal of Instruction-Level Parallelism
Zehra Sura, Arpith Chacko Jacob, et al.
CF 2015