Trace processors
Eric Rotenberg, Quinn A. Jacobson, Yiannakis Sazeides et al. · 1997
Traces are dynamic instruction sequences constructed and cached by hardware. A microarchitecture organized around traces is presented as a means for efficiently executing many instructions per cycle. Trace processors exploit both control flow and data flow hierarchy to overcome complexity and architectural limitations of conventional superscalar processors by (1) distributing execution resources based on trace boundaries and (2) applying control and data prediction at the trace level rather than individual branches or instructions. Three sets of experiments using the SPECInt95 benchmarks are presented. (i) A detailed evaluation of trace processor configurations: the results affirm that significant instruction-level parallelism can be exploited in integer programs (2 to 6 instructions per cycle). We also isolate the impact of distributed resources, and quantify the value of successively doubling the number of distributed elements. (ii) A trace processor with data prediction applied to inter-trace dependences: potential performance improvement with perfect prediction is around 45% for all benchmarks. With realistic prediction, gcc achieves an actual improvement of 10%. (iii) Evaluation of aggressive control flow: some benchmarks benefit from control independence by as much as 10%.
Cited by 287 works. doi:10.5555/266800.266814
Authors
References
- Multiscalar processors
- Complexity-effective superscalar processors
- Trace Cache: A Low Latency Approach to High Bandwidth Instruction Fetching
- Assigning confidence to conditional branch predictions
- ARB: a hardware mechanism for dynamic reordering of memory references
- The multiscalar architecture
- Limits of control flow on parallelism
- Dynamic speculation and synchronization of data dependences
- The predictability of data values
- Hardware support for large atomic units in dynamically scheduled machines