Exploring instruction-fetch bandwidth requirement in wide-issue superscalar processors
- 20 January 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The effective performance of wide-issue superscalar processors depends on many parameters, such as branch prediction accuracy, available instruction-level parallelism, and instruction-fetch bandwidth. This paper explores the relations between some of these parameters, and more particularly, the requirement in instruction-fetch bandwidth. We introduce new enhancements to boost effectively the instruction-fetch bandwidth of conventional fetch engines. However, experiments strongly show that performance improves less for a given instruction-fetch bandwidth gain as the base fetch bandwidth increases. At the level of bandwidth exhibited by the proposed schemes, the performance improvement is small. This clearly brings to light potential relations between the fetch bandwidth and the other parameters. We provide a model to explain this behaviour and quantify some relations. Based on the experimental observation that the available parallelism in an instruction window of size N grows as the square root /spl radic/N, we derive from the model that the instruction fetch bandwidth requirement increases as the square root of the distance between mispredicted branches. We also show that the instruction fetch bandwidth requirement increases linearly with the parallelism available in a fixed-size instruction window.Keywords
This publication has 18 references indexed in Scilit:
- Trace cache: a low latency approach to high bandwidth instruction fetchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The effect of instruction fetch bandwidth on value predictionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Dynamic hammock predication for non-predicated instruction set architecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Instruction fetching: Coping with code bloatPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Selective eager execution on the PolyPath architectureACM SIGARCH Computer Architecture News, 1998
- Target prediction for indirect jumpsPublished by Association for Computing Machinery (ACM) ,1997
- Analysis of branch prediction via data compressionPublished by Association for Computing Machinery (ACM) ,1996
- Multiple-block ahead branch predictorsPublished by Association for Computing Machinery (ACM) ,1996
- Optimization of instruction fetch mechanisms for high issue ratesPublished by Association for Computing Machinery (ACM) ,1995
- Increasing the instruction fetch rate via multiple branch prediction and a branch address cachePublished by Association for Computing Machinery (ACM) ,1993