The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Program locality analysis using reuse distance
Open accessAbstract
On modern computer systems, the memory performance of an application depends on its locality. For a single execution, locality-correlated measures like average miss rate or working-set size have long been analyzed using reuse distance —the number of distinct locations accessed between consecutive accesses to a given location. This article addresses the analysis problem at the program level, where the size of data and the locality of execution may change significantly depending on the input. The article presents two techniques that predict how the locality of a program changes with its input. The first is approximate reuse-distance measurement, which is asymptotically faster than exact methods while providing a guaranteed precision. The second is statistical prediction of locality in all executions of a program based on the analysis of a few executions. The prediction process has three steps: dividing data accesses into groups, finding the access patterns in each group, and building parameterized models. The resulting prediction may be used on-line with the help of distance-based sampling. When evaluated on fifteen benchmark applications, the new techniques predicted program locality with good accuracy, even for test executions that are orders of magnitude larger than the training executions. The two techniques are among the first to enable quantitative analysis of whole-program locality in general sequential code. These findings form the basis for a unified understanding of program locality and its many facets. Concluding sections of the article present a taxonomy of related literature along five dimensions of locality and discuss the role of reuse distance in performance modeling, program optimization, cache and virtual memory management, and network traffic analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Evaluating associativity in CPU caches
Hill, M. D., & Smith, A. J. (1989) · IEEE Transactions on Computers · doi:10.1109/12.40842 · Cited by 606
Improving the ratio of memory operations to floating-point operations in loops
Carr, S., & Kennedy, K. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/197320.197366 · Cited by 155
Cited by
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State
Gong, Y., Cai, X., Sang, Q., Lu, T., Hu, C., & Cheng, D. (2026) · IEEE Transactions on Computers · doi:10.1109/tc.2026.3699453
Metadata
- Authors
- Zhong, Y., Shen, X., & Ding, C.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 2009-08
- Volume
- 31
- Issue
- 6
- Pages
- 1-39
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2091250014
- Cited by
- 166
- References
- 2
- FWCI
- 19.32
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Program locality analysis using reuse distance. https://app.cochat.ai/papers/10.1145/1552309.1552310
- The paper
- Zhong, Y., Shen, X., & Ding, C. (2009). Program locality analysis using reuse distance. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/1552309.1552310
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.