Table size reduction for data value predictors by exploiting narrow width values

Recently, the practice of speculation in resolving data dependences has been studied as a means of extracting more instruction level parallelism (ILP). An outcome of an instruction is predicted by value predictors. The instruction and its dependent instructions can be executed simultaneously, thereby exploiting ILP aggressively. One of the serious hurdles for realizing data speculation is huge hardware budget of the predictors. In this paper, we propose a technique reducing the budget by exploiting narrow width values. The hardware budget of value predictors is reduced by up to 45.1%. Simulation results show that the technique, called 2-mode scheme, maintains processor performance with slight decrease of the value prediction accuracy.

[1]  John Paul Shen,et al.  Efficient and Accurate Value Prediction Using Dynamic Classification , 1998 .

[2]  Todd M. Austin,et al.  The SimpleScalar tool set, version 2.0 , 1997, CARN.

[3]  Uri C. Weiser,et al.  Intel MMX for multimedia PCs , 1997, Commun. ACM.

[4]  Dean M. Tullsen,et al.  Storageless value prediction using prior register values , 1999, ISCA.

[5]  Rajiv Gupta,et al.  Global context-based value prediction , 1999, Proceedings Fifth International Symposium on High-Performance Computer Architecture.

[6]  Miodrag Potkonjak,et al.  MediaBench: a tool for evaluating and synthesizing multimedia and communications systems , 1997, Proceedings of 30th Annual International Symposium on Microarchitecture.

[7]  Kai Wang,et al.  Highly accurate data value prediction using hybrid predictors , 1997, Proceedings of 30th Annual International Symposium on Microarchitecture.

[8]  Mikko H. Lipasti,et al.  Value locality and load value prediction , 1996, ASPLOS VII.

[9]  F. Gabbay.  Speculative Execution based on Value Prediction Research Proposal towards the Degree of Doctor of Sciences , 1996 .

[10]  Margaret Martonosi,et al.  Dynamically exploiting narrow width operands to improve processor power and performance , 1999, Proceedings Fifth International Symposium on High-Performance Computer Architecture.

[11]  Qing Yang,et al.  CAT - caching address tags - a technique for reducing area cost of on-chip caches , 1995, Proceedings 22nd Annual International Symposium on Computer Architecture.

[12]  Karel Driesen,et al.  The Cascaded Predictor: Economic and Adaptive BranchTarget Prediction , 1998 .

[13]  Karel Driesen,et al.  The cascaded predictor: economical and adaptive branch target prediction , 1998, Proceedings. 31st Annual ACM/IEEE International Symposium on Microarchitecture.

[14]  Mikko H. Lipasti,et al.  Cache miss heuristics and preloading techniques for general-purpose programs , 1995, Proceedings of the 28th Annual International Symposium on Microarchitecture.

[15]  Enric Morancho,et al.  Split last-address predictor , 1998, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192).

[16]  Glenn Reinman,et al.  Selective value prediction , 1999, ISCA.

[17]  James E. Smith,et al.  Implementations of Context Based Value Predictors , 1997 .