A First-Order Superscalar Processor Model
Authors:
Open Access
- 2 March 2004
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 32 (2) , 338
Abstract
A proposed performance model for superscalar processorsconsists of 1) a component that models the relationshipbetween instructions issued per cycle and the sizeof the instruction window under ideal conditions, and 2)methods for calculating transient performance penaltiesdue to branch mispredictions, instruction cache misses,and data cache misses.Using trace-derived data dependenceinformation, data and instruction cache miss rates,and branch miss-prediction rates as inputs, the model canarrive at performance estimates for a typical superscalarprocessor that are within 5.8% of detailed simulation onaverage and within 13% in the worst case. The modelalso provides insights into the workings of superscalarprocessors and long-term microarchitecture trends such aspipeline depths and issue widths.Keywords
This publication has 9 references indexed in Scilit:
- Exploring instruction-fetch bandwidth requirement in wide-issue superscalar processors2003
- Modeling superscalar processors via statistical simulation2002
- Performance analysis through synthetic trace generation2002
- An Exploration of Instruction Fetch Requirement in Out-of-Order Superscalar ProcessorsInternational Journal of Parallel Programming, 2001
- Theoretical modeling of superscalar processor performance1994
- The nonuniform distribution of instruction-level and machine parallelism and its effect on performanceIEEE Transactions on Computers, 1989
- Characterization of Branch and Data Dependencies in Programs for Evaluating Pipeline PerformanceIEEE Transactions on Computers, 1987
- Instruction issue logic for high-performance, interruptable pipelined processors1987
- The Inhibition of Potential Parallelism by Conditional JumpsIEEE Transactions on Computers, 1972