The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A compiler framework for optimization of affine loop nests for gpgpus
Abstract
GPUs are a class of specialized parallel architectures with tremendous computational power. The new Compute Unified Device Architecture (CUDA) programming model from NVIDIA facilitates programming of general purpose applications on their GPUs. However, manual development of high-performance parallel code for GPUs is still very challenging. In this paper, a number of issues are addressed towards the goal of developing a compiler framework for automatic parallelization and performance optimization of affine loop nests on GPGPUs: 1) approach to program transformation for efficient data access from GPU global memory, using a polyhedral compiler model of data dependence abstraction and program transformation; 2) determination of optimal padding factors for conflict-minimal data access from GPU shared memory; and 3) model-driven empirical search to determine optimal parameters for unrolling and tiling. Experimental results on a number of kernels demonstrate the effectiveness of the compiler optimization approaches developed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Cited by
Benchmarking GPUs to tune dense linear algebra
Volkov, V. M., & Demmel, J. W. (2008) · doi:10.5555/1413370.1413402 · Cited by 701
Benchmarking GPUs to tune dense linear algebra
Volkov, V., & Demmel, J. W. (2008) · 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2008.5214359 · Cited by 489
Auto-tuning a high-level language targeted to GPU codes
Grauer-Gray, S., Xu, L., Searles, R., Ayalasomayajula, S., & Cavazos, J. (2012) · 2012 Innovative Parallel Computing (InPar) · doi:10.1109/inpar.2012.6339595 · Cited by 470
A GPGPU compiler for memory optimization and parallelism management
Yang, Y., Xiang, P., Kong, J., & Zhou, H. (2010) · Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1806596.1806606 · Cited by 273
Accelerating advanced MRI reconstructions on GPUs
Stone, S. S., Haldar, J. P., Tsao, S. C., Hwu, W.-M. W., Sutton, B. P., & Liang, Z.-P. (2008) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2008.05.013 · Cited by 249
Metadata
- Authors
- Baskaran, M. M., Bondhugula, U., Krishnamoorthy, S., Ramanujam, J., Rountev, A., & Sadayappan, P.
- Venue
- Proceedings of the 22nd annual international conference on Supercomputing
- Publisher
- ACM
- Published
- 2008-06-07
- Pages
- 225-234
- OpenAlex
- W2083056254
- Cited by
- 216
- References
- 1
- FWCI
- 13.78
- 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
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 compiler framework for optimization of affine loop nests for gpgpus. https://app.cochat.ai/papers/10.1145/1375527.1375562
- The paper
- Baskaran, M. M., Bondhugula, U., Krishnamoorthy, S., Ramanujam, J., Rountev, A., & Sadayappan, P. (2008). A compiler framework for optimization of affine loop nests for gpgpus. Proceedings of the 22nd annual international conference on Supercomputing. https://doi.org/10.1145/1375527.1375562
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.