The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
A practical automatic polyhedral parallelizer and locality optimizer
Abstract
We present the design and implementation of an automatic polyhedral source-to-source transformation framework that can optimize regular programs (sequences of possibly imperfectly nested loops) for parallelism and locality simultaneously. Through this work, we show the practicality of analytical model-driven automatic transformation in the polyhedral model -- far beyond what is possible by current production compilers. Unlike previous works, our approach is an end-to-end fully automatic one driven by an integer linear optimization framework that takes an explicit view of finding good ways of tiling for parallelism and locality using affine transformations. The framework has been implemented into a tool to automatically generate OpenMP parallel code from C program sections. Experimental results from the tool show very high speedups for local and parallel execution on multi-cores over state-of-the-art compiler frameworks from the research community as well as the best native production compilers. The system also enables the easy use of powerful empirical/iterative optimization for general arbitrarily nested loop sequences.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
A generalized inverse for matrices
Penrose, R. (1955) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100030401 · Cited by 4,551
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
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
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
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
A practical algorithm for exact array dependence analysis
Pugh, W. (1992) · Communications of the ACM · doi:10.1145/135226.135233 · Cited by 568
Dataflow analysis of array and scalar references
Feautrier, P. (1991) · International Journal of Parallel Programming · doi:10.1007/bf01407931 · Cited by 567
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
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
Research works printed but not linked: 13
- 10.5555/1025127.1025992 · doi:10.5555/1025127.1025992
- 10.5555/1765931.1765962 · doi:10.5555/1765931.1765962
- 10.5555/1788374.1788386 · doi:10.5555/1788374.1788386
- 10.5555/556139 · doi:10.5555/556139
- 10.1007/BF01407835 · DOI · Paper page
- Goumas G., 2002, Code Generation Methods for Tiling Transformations. J. of Information Science and Engineering, 18, 667
- Kelly W., 1995, Intl. Symp. on the frontiers of massively parallel computation, 332
- Norris B., 2007, Annotations for performance and productivity
- Pop S., 2006, Proc. of the 4th GCC Developper?s summit
- Schreiber R., 1990, Automatic blocking of nested loops. Technical report
- Whaley R., 2000, Parallel Computing
- Wilde D. K., 1993, IRISA
- 10.5555/353939 · doi:10.5555/353939
Cited by
MLIR: Scaling Compiler Infrastructure for Domain Specific Computation
Lattner, C., Amini, M., Bondhugula, U., Cohen, A., Davis, A., Pienaar, J., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O. (2021) · 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) · doi:10.1109/cgo51591.2021.9370308 · Cited by 541
Self-citationPolyhedral parallel code generation for CUDA
Verdoolaege, S., Carlos Juega, J., Cohen, A., Ignacio Gómez, J., Tenllado, C., & Catthoor, F. (2013) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2400682.2400713 · Cited by 382
Memory-centric accelerator design for Convolutional Neural Networks
Peemen, M., Setio, A. A. A., Mesman, B., & Corporaal, H. (2013) · 2013 IEEE 31st International Conference on Computer Design (ICCD) · doi:10.1109/iccd.2013.6657019 · Cited by 332
An auto-tuning framework for parallel multicore stencil computations
Kamil, S., Chan, C., Oliker, L., Shalf, J., & Williams, S. (2010) · 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS) · doi:10.1109/ipdps.2010.5470421 · Cited by 209
Tiling stencil computations to maximize parallelism
Bandishti, V., Pananilath, I., & Bondhugula, U. (2012) · 2012 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2012.107 · Cited by 175
Self-citation
Metadata
- Authors
- Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P.
- Affiliations
- The Ohio State University (US)
- Louisiana State University (US)
- Venue
- ACM SIGPLAN Notices
- Published
- 2008-05-30
- Volume
- 43
- Issue
- 6
- Pages
- 101-113
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W3151489216
- Cited by
- 248
- References
- 41
- Citations by year
- 2026: 13 · 2025: 11 · 2024: 7 · 2023: 15 · 2022: 16 · 2021: 25 · 2020: 19 · 2019: 19 · 2018: 28 · 2017: 24 · 2016: 18 · 2015: 13 · 2014: 9 · 2013: 8 · 2012: 9
- FWCI
- 9.67
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM SIGPLAN Notices (publishedVersion)
- Civil War Book Review (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
- Keywords
- polyhedral models, automatic parallelization, locality optimization, source-to-source translation, loop tiling, integer linear programming, affine transformation, nested loops, compiler optimization
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A practical automatic polyhedral parallelizer and locality optimizer. https://app.cochat.ai/papers/10.1145/1379022.1375595
- The paper
- Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008). A practical automatic polyhedral parallelizer and locality optimizer. ACM SIGPLAN Notices. https://doi.org/10.1145/1379022.1375595
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.