The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Runahead execution: an alternative to very large instruction windows for out-of-order processors
Abstract
Today's high performance processors tolerate long latency operations by means of out-of-order execution. However, as latencies increase, the size of the instruction window must increase even faster if we are to continue to tolerate these latencies. We have already reached the point where the size of an instruction window that can handle these latencies is prohibitively large in terms of both design complexity and power consumption. And, the problem is getting worse. This paper proposes runahead execution as an effective way to increase memory latency tolerance in an out-of-order processor without requiring an unreasonably large instruction window. Runahead execution unblocks the instruction window blocked by long latency operations allowing the processor to execute far ahead in the program path. This results in data being prefetched into caches long before it is needed. On a machine model based on the Intel/spl reg/ Pentium/spl reg/ processor, having a 128-entry instruction window, adding runahead execution improves the IPC (instructions per cycle) by 22% across a wide range of memory intensive applications. Also, for the same machine model, runahead execution combined with a 128-entry window performs within 1% of a machine with no runahead execution and a 384-entry instruction window.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Mips R10000 superscalar microprocessor
Yeager, K. C. (1996) · IEEE Micro · doi:10.1109/40.491460 · Cited by 839
Design and evaluation of a compiler algorithm for prefetching
Mowry, T. C., Lam, M. S., & Gupta, A. (1992) · Proceedings of the fifth international conference on Architectural support for programming languages and operating systems · doi:10.1145/143365.143488 · Cited by 767
The microarchitecture of the Pentium 4 processor
Hinton, G. (2001) · Medical Entomology and Zoology · Cited by 587
An effective on-chip preloading scheme to reduce data access penalty
Baer, J.-L., & Chen, T.-F. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125932 · Cited by 466
Dynamic branch prediction with perceptrons
Jiménez, D. A., & Lin, C. (2002) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2001.903263 · Cited by 427
Cited by
A scalable processing-in-memory accelerator for parallel graph processing
Ahn, J., Hong, S., Yoo, S., Mutlu, O., & Choi, K. (2015) · Proceedings of the 42nd Annual International Symposium on Computer Architecture · doi:10.1145/2749469.2750386 · Cited by 767
Self-citationParallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems
Mutlu, O., & Moscibroda, T. (2008) · 2008 International Symposium on Computer Architecture · doi:10.1109/isca.2008.7 · Cited by 345
Self-citationA case for exploiting subarray-level parallelism (SALP) in DRAM
Kim, Y., Seshadri, V., Lee, D., Liu, J., & Mutlu, O. (2012) · ACM SIGARCH Computer Architecture News · doi:10.1145/2366231.2337202 · Cited by 259
Self-citationA Ubiquitous Machine Learning Accelerator with Automatic Parallelization on FPGA
Wang, C., Gong, L., Li, X., & Zhou, X. (2020) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.2990924 · Cited by 37
Metadata
- Authors
- Mutlu, O., Stark, J., Wilkerson, C., & Patt, Y. N.
- Venue
- The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-08-27
- Pages
- 129-140
- OpenAlex
- W2123608497
- Cited by
- 440
- References
- 5
- FWCI
- 22.97
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Runahead execution: an alternative to very large instruction windows for out-of-order processors. https://app.cochat.ai/papers/10.1109/hpca.2003.1183532
- The paper
- Mutlu, O., Stark, J., Wilkerson, C., & Patt, Y. N. (2003). Runahead execution: an alternative to very large instruction windows for out-of-order processors. The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings. https://doi.org/10.1109/hpca.2003.1183532
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.