The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Supernode partitioning
Abstract
Supercompilers must reschedule computations defined by nested DO-loops in order to make an efficient use of supercomputer features (vector units, multiple elementary processors, cache memory, etc…). Many rescheduling techniques like loop interchange, loop strip-mining or rectangular partitioning have been described to speedup program execution. We present here a class of partitionings that encompasses previous techniques and provides enough flexibility to adapt code to multiprocessors with two levels of parallelism and two levels of memory.
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
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Optimizing supercompilers for supercomputers
Wolfe, M. (2020) · Proceedings of the 34th ACM International Conference on Supercomputing · doi:10.1145/3392717.3400034 · Cited by 837
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
The parallel execution of DO loops
Lamport, L. (1974) · Communications of the ACM · doi:10.1145/360827.360844 · Cited by 611
Allen, J. R., & Kennedy, K. (1984) · ACM SIGPLAN Symposium on Compiler Construction · doi:10.1145/502874.502897 · Cited by 185
Direct parallelization of call statements
Triolet, R., Irigoin, F., & Feautrier, P. (1986) · Proceedings of the 1986 SIGPLAN symposium on Compiler construction · doi:10.1145/12276.13329 · Cited by 174
Self-citationMinimum distance: a method for partitioning recurrences for multiprocessors
Peir, J.-K., & Cytron, R. K. (1989) · IEEE Transactions on Computers · doi:10.1109/12.30873 · Cited by 88
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
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
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
Abstract interpretation and application to logic programs
Cousot, P., & Cousot, R. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90030-7 · Cited by 582
Dataflow analysis of array and scalar references
Feautrier, P. (1991) · International Journal of Parallel Programming · doi:10.1007/bf01407931 · Cited by 567
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
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
Wolfe, M. (1989) · Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89 · doi:10.1145/76263.76337 · Cited by 429
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
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
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
A practical automatic polyhedral parallelizer and locality optimizer
Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008) · ACM SIGPLAN Notices · doi:10.1145/1379022.1375595 · Cited by 248
Fast Convolutional Nets With fbfft: A GPU Performance Evaluation
Vasilache, N., Johnson, J., Mathieu, M., Chintala, S., Piantino, S., & LeCun, Y. (2014) · arXiv · doi:10.48550/arxiv.1412.7580 · Cited by 246
“A key principle is to design a set of leaf kernels with well-tuned in-register performance and reduce the larger problem to a combination of these kernels by data and loop tiling (Irigoin & Triolet (1988)) and recursive decompositions (Gunnels et al. (2001)).”
BackgroundTiling 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
Metadata
- Authors
- Irigoin, F., & Triolet, R.
- Venue
- Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88
- Publisher
- ACM Press
- Published
- 1988
- Pages
- 319-329
- OpenAlex
- W2296218291
- Cited by
- 564
- References
- 8
- FWCI
- 7.41
- 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.