Dynamic Branch Prediction with Perceptrons

This paper presents a new method for branch prediction. The key idea is to use one of the simplest possible neural networks, the perceptron as an alternative to the commonly used two-bit counters. Our predictor achieves increased accuracy by making use of long branch histories, which are possible because the hardware resources for our method scale linearly with the history length. By contrast, other purely dynamic schemes require exponential resources. We describe our design and evaluate it with respect to two well known predictors. We show that for a 4K byte hardware budget our method improves misprediction rates for the SPEC 2000 benchmarks by 10.1% over the gshare predictor. Our experiments also provide a better understanding of the situations in which traditional predictors do and do not perform well. Finally, we describe techniques that allow our complex predictor to operate in one cycle.

• Type: Conference
• Year: 2001
• Where: HPCA
• Authors: Daniel A. Jiménez, Calvin Lin
• Keywords: Complex Predictor, Computer Architecture, Gshare Predictor, HPCA 2001, Method Improves Misprediction