HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Analysis of a tag-based branch predictor

Pierre Michaud 1
1 CAPS - Compilation, parallel architectures and system
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : The method most often used for inventing new branch predictors is to start from a known predictor and try to improve it. However, this method gives little insight in the frequent case where we fail to improve the predictor. This study proposes a new approach, which we think provides a better understanding. We start from a model of ideal predictor, and introduce successive degradations, until we obtain a predictor that can be implemented in hardware. On each degradation, it is possible to quantify the loss, analyze the reasons for it, and sometimes propose remedies. This paper is an illustration of this method on the family of tag-based predictors derived from PPM.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 9:05:36 PM
Last modification on : Friday, February 4, 2022 - 3:16:24 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:37:39 PM


  • HAL Id : inria-00070637, version 1


Pierre Michaud. Analysis of a tag-based branch predictor. [Research Report] RR-5366, INRIA. 2004, pp.21. ⟨inria-00070637⟩



Record views


Files downloads