The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Polyhedral parallel code generation for CUDA
Open accessAbstract
This article addresses the compilation of a sequential program for parallel execution on a modern GPU. To this end, we present a novel source-to-source compiler called PPCG. PPCG singles out for its ability to accelerate computations from any static control loop nest, generating multiple CUDA kernels when necessary. We introduce a multilevel tiling strategy and a code generation scheme for the parallelization and locality optimization of imperfectly nested loops, managing memory and exposing concurrency according to the constraints of modern GPUs. We evaluate our algorithms and tool on the entire PolyBench suite.
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
High-Performance Compilers for Parallel Computing
Wolfe, M., Shanklin, C., & Ortega, L. (1995) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,319
Optimizing Compilers for Modern Architectures: A Dependence-based Approach
Kennedy, K., & Allen, J. R. (2001) · Cited by 1,002
Optimization principles and application performance evaluation of a multithreaded GPU using CUDA
Ryoo, S., Rodrigues, C. I., Baghsorkhi, S. S., Stone, S. S., Kirk, D. B., & Hwu, W.-M. W. (2008) · Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming · doi:10.1145/1345206.1345220 · Cited by 903
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
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
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
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
isl: An Integer Set Library for the Polyhedral Model
Verdoolaege, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15582-6_49 · Cited by 334
Self-citationProgram optimization space pruning for a multithreaded gpu
Ryoo, S., Rodrigues, C. I., Stone, S. S., Baghsorkhi, S. S., Ueng, S.-Z., Stratton, J. A., & Hwu, W.-M. W. (2008) · Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization · doi:10.1145/1356058.1356084 · Cited by 285
Minimizing development and maintenance costs in supporting persistently optimized BLAS
Whaley, R. C., & Petitet, A. (2005) · Software: Practice and Experience · doi:10.1002/spe.626 · Cited by 254
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
The Polyhedral Model Is More Widely Applicable Than You Think
Benabderrahmane, M.-W., Pouchet, L.-N., Cohen, A., & Bastoul, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11970-5_16 · Cited by 232
Self-citationAutomatic C-to-CUDA Code Generation for Affine Programs
Baskaran, M. M., Ramanujam, J., & Sadayappan, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11970-5_14 · Cited by 204
A cross-input adaptive framework for GPU program optimizations
Liu, Y., Zhang, E. Z., & Shen, X. (2009) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2009.5160988 · Cited by 153
Polly – Polyhedral optimization in LLVM
Grosser, T., Zheng, H., Aloor, R., Simbürger, A., Größlinger, A., & Pouchet, L.-N. (2012) · Cited by 127
Polyhedral-Model Guided Loop-Nest Auto-Vectorization
Trifunović, K., Nuzman, D., Cohen, A., Zaks, A., & Rosen, I. (2009) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact.2009.18 · Cited by 122
Self-citationPLuTo: A practical and fully automatic polyhedral program optimization system
Bondhugula, U. K. R., & Ramanujam, J. (2008) · Cited by 106
Parameterized tiled loops for free
Renganarayanan, L., Kim, D., Rajopadhye, S. V., & Strout, M. M. (2007) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1250734.1250780 · Cited by 94
Verdoolaege, S., & Grosser, T. (2012) · doi:10.13140/rg.2.1.4213.4562 · Cited by 86
Self-citationLoop parallelization algorithms: From parallelism extraction to code generation
Boulet, P., Darte, A., Silber, G.-A., & Vivien, F. (1998) · Parallel Computing · doi:10.1016/s0167-8191(98)00020-9 · Cited by 83
A Programming Language Interface to Describe Transformations and Code Generation
Rudy, G., Khan, M. M., Hall, M. W., Chen, C., & Chame, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19595-2_10 · Cited by 77
Compiler-Controlled Caching in Superword Register Files for Multimedia Extension Architectures
Shin, J., Chame, J., & Hall, M. W. (2002) · Cited by 54
Automatic Restructuring of GPU Kernels for Exploiting Inter-thread Data Locality
Unkule, S., Shaltz, C., & Qasem, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28652-0_2 · Cited by 31
Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes
Größlinger, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00722-4_17 · Cited by 27
Putting Automatic Polyhedral Compilation for GPGPU to Work
Baghdadi, S., Größlinger, A., & Cohen, A. (2011) · Cited by 22
Self-citationImproving parallelism and data locality with affine partitioning
Lam, M. S., & Lim, A. W. (2001) · Cited by 17
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-citation
Metadata
- Authors
- Verdoolaege, S., Carlos Juega, J., Cohen, A., Ignacio Gómez, J., Tenllado, C., & Catthoor, F.
- Venue
- ACM Transactions on Architecture and Code Optimization
- Published
- 2013-01
- Volume
- 9
- Issue
- 4
- Pages
- 1-23
- ISSN
- 1544-3566 (ISSN-L)
- 1544-3973
- OpenAlex
- W2077143534
- Cited by
- 382
- References
- 27
- FWCI
- 63.45
- Type
- journal article
- 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.