The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Improving data locality with loop transformations
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 the this article, 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. To validate our optimization strategy, we implemented our algorithms and ran experiments on a large collection of scientific programs and kernels. Experiments illustrate that for kernels our model and algorithm can select and achieve the best loop structure for a nest. For over 30 complete applications, we executed the original and transformed versions and simulated cache hit rates. We collected statistics about the inherent characteristics of these programs and our ability to improve their data locality. To our knowledge, these studies are the first of such breadth and depth. We found performance improvements were difficult to achieve bacause benchmark programs typically have high hit rates even for small data caches; however, our optimizations significanty improved several 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
Automatic translation of FORTRAN programs to vector form
Allen, R., & Kennedy, K. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/29873.29875 · Cited by 734
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
Proceedings of the 2000 International Conference on Parallel Processing
(2000) · Proceedings 2000 International Conference on Parallel Processing ICPP-00 · doi:10.1109/icpp.2000.876064 · Cited by 420
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-citationStrategies 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-citation
Cited by
Kjolstad, F., Kamil, S., Chou, S., Lugato, D., & Amarasinghe, S. (2017) · Proceedings of the ACM on Programming Languages · doi:10.1145/3133901 · Cited by 358
A taxonomy of Data Grids for distributed data sharing, management, and processing
Venugopal, S., Buyya, R., & Ramamohanarao, K. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132955 · Cited by 351
Cache miss equations: a compiler framework for analyzing and tuning memory behavior
Ghosh, S., Martonosi, M., & Malik, S. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/325478.325479 · Cited by 269
Self-Adapting Linear Algebra Algorithms and Software
Demmel, J., Dongarra, J., Eijkhout, V., Fuentes, E., Petitet, A., Vuduc, R., Whaley, R. C., & Yelick, K. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840848 · Cited by 204
Tiling Optimizations for 3D Scientific Computations
Rivera, G., & Tseng, C.-W. (2000) · ACM/IEEE SC 2000 Conference (SC'00) · doi:10.1109/sc.2000.10015 · Cited by 127
Self-citation
Metadata
- Authors
- McKinley, K. S., Carr, S., & Tseng, C.-W.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1996-07
- Volume
- 18
- Issue
- 4
- Pages
- 424-453
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2108315152
- Cited by
- 551
- References
- 23
- FWCI
- 31.75
- Type
- journal article
- 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: Improving data locality with loop transformations. https://app.cochat.ai/papers/10.1145/233561.233564
- The paper
- McKinley, K. S., Carr, S., & Tseng, C.-W. (1996). Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/233561.233564
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.