Constraint graph analysis of multithreaded programs
Harold W. Cain, Mikko H. Lipasti, et al.
Journal of Instruction-Level Parallelism
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
Harold W. Cain, Mikko H. Lipasti, et al.
Journal of Instruction-Level Parallelism
C. Andrew Neff, Ravi Nair
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Matthew Arnold, David Piorkowski, et al.
IBM J. Res. Dev
Ravi Nair
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems