The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Predicting whole-program locality through reuse distance analysis
Abstract
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here locality is defined by the distance of data reuse. Studying whole-program data reuse may reveal global patterns not apparent in short-distance reuses or local control flow. However, the analysis must meet two requirements to be useful. The first is efficiency. It needs to analyze all accesses to all data elements in full-size benchmarks and to measure distance of any length and in any required precision. The second is predication. Based on a few training runs, it needs to classify patterns as regular and irregular and, for regular ones, it should predict their (changing) behavior for other inputs. In this paper, we show that these goals are attainable through three techniques: approximate analysis of reuse distance (originally called LRU stack distance), pattern recognition, and distance-based sampling. When tested on 15 integer and floating-point programs from SPEC and other benchmark suites, our techniques predict with on average 94% accuracy for data inputs up to hundreds times larger than the training inputs. Based on these results, the paper discusses possible uses of this analysis.
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
Automatically characterizing large scale program behavior
Sherwood, T., Perelman, E., Hamerly, G., & Calder, B. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605403 · Cited by 1,674
Evaluation techniques for storage hierarchies
Mattson, R. L., Gecsei, J., Slutz, D. R., & Traiger, I. L. (1970) · IBM Systems Journal · doi:10.1147/sj.92.0078 · Cited by 1,302
Self-adjusting binary search trees
Sleator, D. D., & Tarjan, R. E. (1985) · Journal of the ACM · doi:10.1145/3828.3835 · Cited by 1,228
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
Optimizing Compilers for Modern Architectures: A Dependence-based Approach
Kennedy, K., & Allen, J. R. (2001) · Cited by 1,002
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
An empirical study of FORTRAN programs
Knuth, D. E. (1971) · Software: Practice and Experience · doi:10.1002/spe.4380010203 · Cited by 680
Jiang, S., & Zhang, X. (2002) · Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/511334.511340 · Cited by 489
The Multi-Queue Replacement Algorithm for Second Level Buffer Caches
Zhou, Y., Philbin, J. F., & Li, K. (2001) · Cited by 340
Aspects of Cache Memory and Instruction Buffer Performance
Hill, M. D. (1987) · doi:10.21236/ada604007 · Cited by 245
Metadata
- Authors
- Ding, C., & Zhong, Y.
- Venue
- ACM SIGPLAN Notices
- Published
- 2003-05-09
- Volume
- 38
- Issue
- 5
- Pages
- 245-257
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2024717934
- Cited by
- 258
- References
- 16
- FWCI
- 13.79
- Type
- journal article
- 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: Predicting whole-program locality through reuse distance analysis. https://app.cochat.ai/papers/10.1145/780822.781159
- The paper
- Ding, C., & Zhong, Y. (2003). Predicting whole-program locality through reuse distance analysis. ACM SIGPLAN Notices. https://doi.org/10.1145/780822.781159
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.