The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
An effective on-chip preloading scheme to reduce data access penalty
Open accessAbstract
Conventional cache prefetching approaches can be either hardware-based, generally by using a one-block-Iookahead technique, or compiler-directed, with insertions of non-blocking prefetch instructions.We introduce a new hardware scheme based on the prediction of the execution of the instruction stream and associated operand references.It consists of a reference prediction table and a look-ahead program counter and its associated logic.With this scheme, data with regular access patterns is preloaded, independently of the stride size, and preloading of data with irregular access patterns is prevented.We evaluate our design through trace driven simulation by comparing it with a pure data cache approach under three different memory access models.Our experiments show that this scheme is very effective for reducing the data access penalty for scientific programs and that is has moderate success for other applications.
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
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,370
Smith, A. J. (1982) · ACM Computing Surveys · doi:10.1145/356887.356892 · Cited by 1,722
Branch Prediction Strategies and Branch Target Buffer Design
Lee, & Smith (1984) · Computer · doi:10.1109/mc.1984.1658927 · Cited by 614
Decoupled access/execute computer architectures
Smith, J. E. (1982) · ACM SIGARCH Computer Architecture News · doi:10.1145/1067649.801719 · Cited by 272
Aspects of Cache Memory and Instruction Buffer Performance
Hill, M. D. (1987) · doi:10.21236/ada604007 · Cited by 245
Cited by
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
Runahead execution: an alternative to very large instruction windows for out-of-order processors
Mutlu, O., Stark, J., Wilkerson, C., & Patt, Y. N. (2003) · The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings. · doi:10.1109/hpca.2003.1183532 · Cited by 440
A Survey of Performance Optimization for Mobile Applications
Hort, M., Kechagia, M., Sarro, F., & Harman, M. (2022) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2021.3071193 · Cited by 91
Metadata
- Authors
- Baer, J.-L., & Chen, T.-F.
- Venue
- Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91
- Publisher
- ACM Press
- Published
- 1991
- Pages
- 176-186
- ISSN
- 1063-9535 (ISSN-L)
- OpenAlex
- W2171006257
- Cited by
- 466
- References
- 5
- FWCI
- 9.87
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: An effective on-chip preloading scheme to reduce data access penalty. https://app.cochat.ai/papers/10.1145/125826.125932
- The paper
- Baer, J.-L., & Chen, T.-F. (1991). An effective on-chip preloading scheme to reduce data access penalty. Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91. https://doi.org/10.1145/125826.125932
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.