The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Value locality and load value prediction
Abstract
Since the introduction of virtual memory demand-paging and cache memories, computer systems have been exploiting spatial and temporal locality to reduce the average latency of a memory reference. In this paper, we introduce the notion of value locality, a third facet of locality that is frequently present in real-world programs, and describe how to effectively capture and exploit it in order to perform load value prediction. Temporal and spatial locality are attributes of storage locations, and describe the future likelihood of references to those locations or their close neighbors. In a similar vein, value locality describes the likelihood of the recurrence of a previously-seen value within a storage location. Modern processors already exploit value locality in a very restricted sense through the use of control speculation (i.e. branch prediction), which seeks to predict the future value of a single condition bit based on previously-seen values. Our work extends this to predict entire 32- and 64-bit register values based on previously-seen values. We find that, just as condition bits are fairly predictable on a per-static-branch basis, full register values being loaded from memory are frequently predictable as well. Furthermore, we show that simple microarchitectural enhancements to two modern microprocessor implementations (based on the PowerPC 620 and Alpha 21164) that enable load value prediction can effectively exploit value locality to collapse true dependencies, reduce average memory latency and bandwidth requirements, and provide measurable performance gains.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,082
Smith, A. J. (1982) · ACM Computing Surveys · doi:10.1145/356887.356892 · Cited by 1,722
ATOM: a system for building customized program analysis tools
Srivastava, A., & Eustace, A. (1994) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/178243.178260 · Cited by 981
A study of branch prediction strategies
Smith, J. E. (1998) · 25 years of the international symposia on Computer architecture (selected papers) · doi:10.1145/285930.285980 · Cited by 797
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
Compiler optimizations for improving data locality
Carr, S., McKinley, K. S., & Tseng, C.-W. (1994) · Proceedings of the sixth international conference on Architectural support for programming languages and operating systems · doi:10.1145/195473.195557 · Cited by 291
Cited by
An evaluation of speculative instruction execution on simultaneous multithreaded processors
Swanson, S., McDowell, L. K., Swift, M. M., Eggers, S. J., & Levy, H. M. (2003) · ACM Transactions on Computer Systems · doi:10.1145/859716.859720 · Cited by 17
Metadata
- Authors
- Lipasti, M. H., Wilkerson, C. B., & Shen, J. P.
- Venue
- Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
- Publisher
- ACM
- Published
- 1996-09
- Pages
- 138-147
- OpenAlex
- W2095872092
- Cited by
- 672
- References
- 6
- FWCI
- 28.75
- 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: Value locality and load value prediction. https://app.cochat.ai/papers/10.1145/237090.237173
- The paper
- Lipasti, M. H., Wilkerson, C. B., & Shen, J. P. (1996). Value locality and load value prediction. Proceedings of the seventh international conference on Architectural support for programming languages and operating systems. https://doi.org/10.1145/237090.237173
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.