The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Compiler optimizations for improving data locality
Open accessAbstract
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effective when programs exhibit data locality. In this paper, we present compiler optimizations to improve data locality based on a simple yet accurate cost model. The model computes both temporal and spatial reuse of cache lines to find desirable loop organizations. The cost model drives the application of compound transformations consisting of loop permutation, loop fusion, loop distribution, and loop reversal. We demonstrate that these program transformations are useful for optimizing many programs.
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
A data locality optimizing algorithm
Wolf, M. E., & Lam, M. S. (1991) · Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91 · doi:10.1145/113445.113449 · Cited by 1,331
The cache performance and optimizations of blocked algorithms
Lam, M. D., Rothberg, E. E., & Wolf, M. E. (1991) · Proceedings of the fourth international conference on Architectural support for programming languages and operating systems - ASPLOS-IV · doi:10.1145/106972.106981 · Cited by 921
Dependence graphs and compiler optimizations
Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B., & Wolfe, M. (1981) · Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81 · doi:10.1145/567532.567555 · Cited by 651
Irigoin, F., & Triolet, R. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73588 · Cited by 564
Strategies for cache and local memory management by global program transformation
Gannon, D., Jalby, W., & Gallivan, K. (1988) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(88)90014-7 · Cited by 350
Maximizing loop parallelism and improving data locality via loop fusion and distribution
Kennedy, K., & McKinley, K. S. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-57659-2_18 · Cited by 252
Self-citationImproving register allocation for subscripted variables
Callahan, D., Carr, S., & Kennedy, K. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989428 · Cited by 246
Self-citationGoff, G., Kennedy, K., & Tseng, C.-W. (1991) · Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91 · doi:10.1145/113445.113448 · Cited by 227
Self-citationIteration Space Tiling for Memory Hierarchies
Wolfe, M. (1987) · SIAM Conference on Parallel Processing for Scientific Computing · Cited by 195
On estimating and enhancing cache effectiveness
Ferrante, J., Sarkar, V., & Thrash, W. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0038674 · Cited by 159
Cited by
Value locality and load value prediction
Lipasti, M. H., Wilkerson, C. B., & Shen, J. P. (1996) · Proceedings of the seventh international conference on Architectural support for programming languages and operating systems · doi:10.1145/237090.237173 · Cited by 672
Tile size selection using cache organization and data layout
Coleman, S., & McKinley, K. S. (1995) · Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation · doi:10.1145/207110.207162 · Cited by 402
Self-citationCache-conscious structure layout
Chilimbi, T. M., Hill, M. D., & Larus, J. R. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301633 · Cited by 334
Escape analysis for object-oriented languages: application to Java
Blanchet, B. (1999) · Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/320384.320387 · Cited by 294
Cache-conscious data placement
Calder, B., Krintz, C., John, S., & Austin, T. (1998) · Proceedings of the eighth international conference on Architectural support for programming languages and operating systems · doi:10.1145/291069.291036 · Cited by 268
Metadata
- Authors
- Carr, S., McKinley, K. S., & Tseng, C.-W.
- Venue
- Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
- Publisher
- ACM
- Published
- 1994-11
- Pages
- 252-262
- OpenAlex
- W2244841219
- Cited by
- 291
- References
- 19
- FWCI
- 16.39
- 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: Compiler optimizations for improving data locality. https://app.cochat.ai/papers/10.1145/195473.195557
- The paper
- Carr, S., McKinley, K. S., & Tseng, C.-W. (1994). Compiler optimizations for improving data locality. Proceedings of the sixth international conference on Architectural support for programming languages and operating systems. https://doi.org/10.1145/195473.195557
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.