The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
More iteration space tiling
Open accessAbstract
Subdividing the iteration space of a loop into blocks or tiles with a fixed maximum size has several advantages. Tiles become a natural candidate as the unit of work for parallel task scheduling. Synchronization between processors can be done between tiles, reducing synchronization frequency (at some loss of potential parallelism). The shape and size of a tile can be optimized to take advantage of memory locality for memory hierarchy utilization. Vectorization and register locality naturally fits into the optimization within a tile, while parallelization and cache locality fits into optimization between tiles.
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
Optimizing supercompilers for supercomputers
Wolfe, M. (2020) · Proceedings of the 34th ACM International Conference on Supercomputing · doi:10.1145/3392717.3400034 · Cited by 837
Self-citationAutomatic 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
The parallel execution of DO loops
Lamport, L. (1974) · Communications of the ACM · doi:10.1145/360827.360844 · Cited by 611
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
Iteration Space Tiling for Memory Hierarchies
Wolfe, M. (1987) · SIAM Conference on Parallel Processing for Scientific Computing · Cited by 195
Self-citationAllen, J. R., & Kennedy, K. (1984) · ACM SIGPLAN Symposium on Compiler Construction · doi:10.1145/502874.502897 · Cited by 185
Loops skewing: The wavefront method revisited
Wolfe, M. (1986) · International Journal of Parallel Programming · doi:10.1007/bf01407876 · Cited by 155
Self-citationAllen, J. R., & Kennedy, K. (1984) · ACM SIGPLAN Notices · doi:10.1145/502949.502897 · Cited by 52
Cited by
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
Compiler transformations for high-performance computing
Bacon, D. F., Graham, S. L., & Sharp, O. J. (1994) · ACM Computing Surveys · doi:10.1145/197405.197406 · Cited by 818
A loop transformation theory and an algorithm to maximize parallelism
Wolf, M. E., & Lam, M. S. (1991) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.97902 · Cited by 643
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
Scanning polyhedra with DO loops
Ancourt, C., & Irigoin, F. (1991) · Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/109625.109631 · Cited by 315
Levine, B. G., Stone, J. E., & Kohlmeyer, A. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.01.048 · Cited by 305
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
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
Cache-Efficient Multigrid Algorithms
Sellappa, S., & Chatterjee, S. (2004) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342004041295 · Cited by 49
Metadata
- Authors
- Wolfe, M.
- Venue
- Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89
- Publisher
- ACM Press
- Published
- 1989
- Pages
- 655-664
- ISSN
- 1063-9535 (ISSN-L)
- OpenAlex
- W2063249715
- Cited by
- 429
- References
- 8
- FWCI
- 8.87
- 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
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.