The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Maximizing loop parallelism and improving data locality via loop fusion and distribution
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
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
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
Self-citationCompiler optimizations for improving data locality
Carr, S., McKinley, K. S., & Tseng, C.-W. (1994) · Proceedings of the sixth international conference on Architectural support for programming languages and operating systems · doi:10.1145/195473.195557 · Cited by 291
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-citationThe complexity of multiway cuts (extended abstract)
Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour, P. D., & Yannakakis, M. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129736 · Cited by 221
Automatic decomposition of scientific programs for parallel execution
Allen, R., Callahan, D. P., & Kennedy, K. (1987) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/41625.41631 · Cited by 148
Self-citationCollective loop fusion for array contraction
Gao, G. R., Olsen, R. B., Sarkar, V., & Thekkath, R. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57502-2_53 · Cited by 129
Optimizing for parallelism and data locality
Kennedy, K., & McKinley, K. S. (2014) · International Conference on Supercomputing · doi:10.1145/2591635.2667164 · Cited by 120
Self-citationOptimizing for parallelism and data locality
Kennedy, K., & McKinley, K. S. (1992) · International Conference on Supercomputing · doi:10.1145/143369.143427 · Cited by 94
Self-citationOptimization of array accesses by collective loop transformations
Sarkar, V., & Gao, G. R. (1991) · International Conference on Supercomputing · doi:10.1145/109025.109077 · Cited by 53
A hierarchical basis for reordering transformations
Warren, J. D. (1984) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/800017.800539 · Cited by 45
Cited by
Improving data locality with loop transformations
McKinley, K. S., Carr, S., & Tseng, C.-W. (1996) · ACM Transactions on Programming Languages and Systems · doi:10.1145/233561.233564 · Cited by 551
Self-citationCompiler optimizations for improving data locality
Carr, S., McKinley, K. S., & Tseng, C.-W. (1994) · Proceedings of the sixth international conference on Architectural support for programming languages and operating systems · doi:10.1145/195473.195557 · Cited by 291
Self-citationBlocking and array contraction across arbitrarily nested loops using affine partitioning
Lim, A. W., Liao, S.-W., & Lam, M. S. (2001) · Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming · doi:10.1145/379539.379586 · Cited by 142
Metadata
- Authors
- Kennedy, K., & McKinley, K. S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1994
- Pages
- 301-320
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1585509108
- Cited by
- 252
- References
- 13
- FWCI
- 5.77
- Type
- conference paper
- 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
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.