The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Scanning polyhedra with DO loops
Abstract
Supercompilers perform complex program transformations which often result in new loop bounds. This paper shows that, under the usual assumptions in automatic parallelization, most transformations on loop nests can be expressed as affine transformations on integer sets de ned by polyhedra and that the new loop bounds can be computed with algorithms using Fourier's pairwise elimination method although it is not exact for integer sets. Sufficient conditions to use pairwise elimination on integer sets and to extend it to pseudo-linear constraints are also given. A tradeo has to be made between dynamic overhead due to some bound slackness and compilation complexity but the resulting code is always correct. These algorithms can be used to interchange or block loops regardless of the loop bounds or the blocking strategy and to safely exchange array parts between two levels of a memory hierarchy or between neighboring processors in a distributed memory machine.
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
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Optimizing supercompilers for supercomputers
Wolfe, M. (2020) · Proceedings of the 34th ACM International Conference on Supercomputing · doi:10.1145/3392717.3400034 · Cited by 837
Advanced compiler optimizations for supercomputers
Padua, D. A., & Wolfe, M. J. (1986) · Communications of the ACM · doi:10.1145/7902.7904 · Cited by 690
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
Self-citationWolfe, M. (1989) · Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89 · doi:10.1145/76263.76337 · Cited by 429
Iteration Space Tiling for Memory Hierarchies
Wolfe, M. (1987) · SIAM Conference on Parallel Processing for Scientific Computing · Cited by 195
Allen, 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
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
Multiprocessors: discussion of some theoretical and practical problems
Haiek, D. A. P. (1980) · Cited by 77
Loop Quantization: an Analysis and Algorithm
Aiken, A., & Nicolau, A. E. (1987) · eCommons (Cornell University) · Cited by 29
Cited by
A practical automatic polyhedral parallelizer and locality optimizer
Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008) · Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1375581.1375595 · Cited by 880
The Omega test: a fast and practical integer programming algorithm for dependence analysis
Pugh, W. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125848 · Cited by 750
A practical algorithm for exact array dependence analysis
Pugh, W. (1992) · Communications of the ACM · doi:10.1145/135226.135233 · Cited by 568
Some 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
Code generation in the polyhedral model is easier than you think
Bastoul, C. (2004) · Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004. · doi:10.1109/pact.2004.1342537 · Cited by 447
Metadata
- Authors
- Ancourt, C., & Irigoin, F.
- Venue
- Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
- Publisher
- ACM
- Published
- 1991-04
- Pages
- 39-50
- OpenAlex
- W1995270665
- Cited by
- 315
- References
- 13
- FWCI
- 9.13
- 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.