Merging path and gshare indexing in perceptron branch prediction
Authors:
Open Access
- 1 September 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 2 (3) , 280-300
Abstract
We introduce the hashed perceptron predictor, which merges the concepts behind the gshare, path-based and perceptron branch predictors. This predictor can achieve superior accuracy to a path-based and a global perceptron predictor, previously the most accurate dynamic branch predictors known in the literature. We also show how such a predictor can be ahead pipelined to yield one cycle effective latency. On the SPECint2000 set of benchmarks, the hashed perceptron predictor improves accuracy by up to 15.6% over a MAC-RHSP and 27.2% over a path-based neural predictor.Keywords
This publication has 5 references indexed in Scilit:
- Simulation Differences Between Academia and Industry: A Branch Prediction Case Study2005
- Power-aware branch prediction: characterization and designIEEE Transactions on Computers, 2004
- Neural methods for dynamic branch predictionACM Transactions on Computer Systems, 2002
- Automatically characterizing large scale program behavior2002
- The agree predictorACM SIGARCH Computer Architecture News, 1997