Correct branch prediction is an essential task in modern microarchitectures. In this paper, to additionally increase the prediction accuracy, recovery logics for speculative update branch history are presented. In local or global branch predictors, maintaining speculative update history provides substantial prediction accuracy. However, speculative update history requires a suitable recovery mechanism. This paper proposes recovery logics for speculative update branch history, for both global- and local-history. The proposed solutions provide higher prediction accuracy and guarantee the correctness of program, and they can be efficiently implemented with low hardware costs. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Kwak, J. W., & Jhon, C. S. (2006). Recovery logics for speculative update global and local branch history. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4263 LNCS, pp. 258–266). Springer Verlag. https://doi.org/10.1007/11902140_29
Mendeley helps you to discover research relevant for your work.