Maximizing parallelism and minimizing synchronization with affine transforms
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
This paper presents the first algorithm to find the optimal affine transform that maximizes the degree of parallelism while minimizing the degree of synchronization in a program with arbitrary loop nestings and affine data accesses. The problem is formulated without the use of imprecise data dependence abstractions such as data dependence vectors. The algorithm presented subsumes previously proposed program transformation algorithms that are based on unimodular transformations, loop fusion, fission, scaling, reindexing and/or statement reordering.
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
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Optimizing supercompilers for supercomputers
Wolfe, M. (2020) · Proceedings of the 34th ACM International Conference on Supercomputing · doi:10.1145/3392717.3400034 · Cited by 837
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
Self-citationSome efficient solutions to the affine scheduling problem. I. One-dimensional time
Feautrier, P. (1992) · International Journal of Parallel Programming · doi:10.1007/bf01407835 · Cited by 555
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
Feautrier, P. (1992) · International Journal of Parallel Programming · doi:10.1007/bf01379404 · Cited by 368
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
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
Improving locality and parallelism in nested loops
Wolf, M. E. (1992) · Cited by 157
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
Optimizing for parallelism and data locality
Kennedy, K., & McKinley, K. S. (2014) · International Conference on Supercomputing · doi:10.1145/2591635.2667164 · Cited by 120
Cited by
Tournavitis, G., Wang, Z., Franke, B., & O'Boyle, M. F. P. (2009) · Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1542476.1542496 · Cited by 204
“Automatic Parallelization. Static automatic parallelism extraction has been achieved on restricted DOALL and DOACROSS loops (3; 4; 5 ). Unfortunately, many parallelization oppor tunities could still not be discovered by a static analysis approach due to lack of information at the source code level.”
BackgroundMethodAn affine partitioning algorithm to maximize parallelism and minimize communication
Lim, A. W., Cheong, G. I., & Lam, M. S. (1999) · Proceedings of the 13th international conference on Supercomputing · doi:10.1145/305138.305197 · Cited by 181
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
Self-citationPaSh: light-touch data-parallel shell processing
Vasilakis, N., Kallas, K., Mamouras, K., Benetopoulos, A., & Cvetković, L. (2021) · Proceedings of the Sixteenth European Conference on Computer Systems · doi:10.1145/3447786.3456228 · Cited by 17
Metadata
- Authors
- Lim, A. W., & Lam, M. S.
- Venue
- Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 201-214
- OpenAlex
- W2038543880
- Cited by
- 179
- References
- 11
- FWCI
- 5.48
- 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.