A Computation Saving Partial-Sum-Global-Update Scheme for Perceptron Branch Predictor

With the pipeline deepen and issue width widen, the accuracy of branch predictor becomes more and more important to the performance of a microprocessor. State-of-theart researches have shown that perceptron branch predictor can obtain a higher accuracy than the existing widely used table based branch predictor. One shortcoming of perceptron branch predictor is the high prediction latency which most comes from the computation needed by the predicting process. In this paper, we propose a Partial-Sum-GlobalUpdate scheme to decrease the number of computation of perceptron predictor with marginal accuracy losing. This scheme is orthogonal to the other schemes such as ahead pipelining. Using O-GEHL predictor as example, the simulation results show that with the storage budget changing from 32kbits to 512Kbits our scheme can save up to 18.2% of computation for a prediction in average as while as only

• Type: Conference
• Year: 2009
• Where: CSIE
• Authors: Liqiang He
• Keywords: Branch Predictor, Computer Science, CSIE 2009, Perceptron Branch Predictor, Perceptron Predictor