The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Auto-tuning a high-level language targeted to GPU codes
Abstract
Determining the best set of optimizations to apply to a kernel to be executed on the graphics processing unit (GPU) is a challenging problem. There are large sets of possible optimization configurations that can be applied, and many applications have multiple kernels. Each kernel may require a specific configuration to achieve the best performance, and moving an application to new hardware often requires a new optimization configuration for each kernel. In this work, we apply optimizations to GPU code using HMPP, a high-level directive-based language and source-to-source compiler that can generate CUDA / OpenCL code. However, programming with high-level languages may mean a loss of performance compared to using low-level languages. Our work shows that it is possible to improve the performance of a high-level language by using auto-tuning. We perform auto-tuning on a large optimization space on GPU kernels, focusing on loop permutation, loop unrolling, tiling, and specifying which loop(s) to parallelize, and show results on convolution kernels, codes in the PolyBench suite, and an implementation of belief propagation for stereo vision. The results show that our auto-tuned HMPP-generated implementations are significantly faster than the default HMPP implementation and can meet or exceed the performance of manually coded CUDA / OpenCL implementations.
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
Efficient Belief Propagation for Early Vision
Felzenszwalb, P. F., & Huttenlocher, D. P. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7899-4 · Cited by 1,345
Automated empirical optimizations of software and the ATLAS project
Clint Whaley, R., Petitet, A., & Dongarra, J. J. (2001) · Parallel Computing · doi:10.1016/s0167-8191(00)00087-9 · Cited by 1,317
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
SPIRAL: Code Generation for DSP Transforms
Puschel, M., Moura, J. M. F., Johnson, J. R., Padua, D., Veloso, M. M., Singer, B. W., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840306 · Cited by 826
Sparse matrix solvers on the GPU: conjugate gradients and multigrid
Bolz, J., Farmer, I., Grinspun, E., & Schröder, P. (2005) · ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05 · doi:10.1145/1198555.1198781 · Cited by 741
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Li, X. S., & Demmel, J. W. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779361 · Cited by 628
Sparse matrix solvers on the GPU: conjugate gradients and multigrid
Bolz, J., Farmer, I., Grinspun, E., & Schröder, P. (2003) · ACM Transactions on Graphics · doi:10.1145/882262.882364 · Cited by 540
OSKI: A library of automatically tuned sparse matrix kernels
Vuduc, R., Demmel, J. W., & Yelick, K. A. (2005) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/16/1/071 · Cited by 490
A fast Fourier transform compiler
Frigo, M. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301661 · Cited by 438
Sparsity: Optimization Framework for Sparse Matrix Kernels
Im, E.-J., Yelick, K., & Vuduc, R. (2004) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342004041296 · Cited by 339
A compiler framework for optimization of affine loop nests for gpgpus
Baskaran, M. M., Bondhugula, U., Krishnamoorthy, S., Ramanujam, J., Rountev, A., & Sadayappan, P. (2008) · Proceedings of the 22nd annual international conference on Supercomputing · doi:10.1145/1375527.1375562 · Cited by 216
SPL: a language and compiler for DSP algorithms
Xiong, J., Johnson, J., Johnson, R., & Padua, D. (2001) · Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation · doi:10.1145/378795.378860 · Cited by 191
Synthesis of High-Performance Parallel Programs for a Class of ab Initio Quantum Chemistry Models
Baumgartner, G., Auer, A., Bernholdt, D. E., Bibireata, A., Choppella, V., Cociorva, D., Gao, X., Harrison, R. J., Hirata, S., Krishnamoorthy, S., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840311 · Cited by 190
Predicting Unroll Factors Using Supervised Classification
Stephenson, M., & Amarasinghe, S. (2005) · International Symposium on Code Generation and Optimization · doi:10.1109/cgo.2005.29 · Cited by 185
Combined Selection of Tile Sizes and Unroll Factors Using Iterative Compilation
Kisuki, T., Knijnenburg, P. M. W., & O’Boyle, M. (2000) · doi:10.5555/517554.825767 · Cited by 177
A comparison of empirical and model-driven optimization
Yotov, K., Li, X., Ren, G., Cibulskis, M., DeJong, G., Garzaran, M., Padua, D., Pingali, K., Stodghill, P., & Wu, P. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781140 · Cited by 165
Auto-tuning 3-D FFT library for CUDA GPUs
Nukada, A., & Matsuoka, S. (2009) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/1654059.1654090 · Cited by 137
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 137
Parallel MATLAB: Doing it Right
Choy, R., & Edelman, A. S. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840490 · Cited by 133
Combining Models and Guided Empirical Search to Optimize for Multiple Levels of the Memory Hierarchy
Chen, C., Chame, J., & Hall, M. W. (2005) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2005.10 · Cited by 114
Combining loop transformations considering caches and scheduling
Wolf, M. E., Maydan, D. E., & Chen, D.-K. (2002) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.1996.566468 · Cited by 97
Optimizing Sparse Matrix–Vector Product Computations Using Unroll and Jam
Mellor‐Crummey, J., & Garvin, J. (2004) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342004038951 · Cited by 94
Combined selection of tile sizes and unroll factors using iterative compilation
Kisuki, T., Knijnenburg, P. M. W., & O’boyle, M. F. P. (2002) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact.2000.888348 · Cited by 89
A comparison of empirical and model-driven optimization
Yotov, K., Li, X., Ren, G., Cibulskis, M., DEJONG, G. F., Garzarán, M. J., Padua, D., Pingali, K. K., Stodghill, P. V., & Wu, P. (2003) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/781131.781140 · Cited by 87
A dynamically tuned sorting library
Li, X., Garzarán, M. J., & Padua, D. (2004) · doi:10.5555/977395.977663 · Cited by 80
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
Cache and bandwidth aware matrix multiplication on the GPU
Hall, J. D., Carr, N., & Hart, J. C. (2010) · Cited by 74
Optimizing Sorting with Genetic Algorithms
Li, X., Garzarán, M. J., & Padua, D. (2005) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2005.24 · Cited by 63
Program generation for the all-pairs shortest path problem
Han, S.-C., Franchetti, F., & Püschel, M. (2006) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1145/1152154.1152189 · Cited by 54
Automatic Library Generation for BLAS3 on GPUs
Cui, H., Wang, L., Xue, J., Yang, Y., & Feng, X. (2011) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2011.33 · Cited by 29
A dynamically tuned sorting library
Li, X., Garzarán, M. J., & Padua, D. (2004) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2004.1281668 · Cited by 22
Extendable pattern-oriented optimization directives
Cui, H., Xue, J., Wang, L., Yang, Y., Feng, X., & Fan, D. (2011) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2011.5764679 · Cited by 14
Extendable pattern-oriented optimization directives
Cui, H., Xue, J., Wang, L., et al. (2011) · Symposium on Code Generation and Optimization · doi:10.5555/2190025.2190058 · Cited by 13
Cited by
Performance Optimization using Multimodal Modeling and Heterogeneous GNN
Dutta, A., Alcaraz, J., TehraniJamsaz, A., Cesar, E., Sikora, A., & Jannesari, A. (2023) · Proceedings of the 32nd International Symposium on High-Performance Parallel and Distributed Computing · doi:10.1145/3588195.3592984 · Cited by 16
Efficient Intra-Rack Resource Disaggregation for HPC Using Co-Packaged DWDM Photonics
Michelogiannakis, G., Arafa, Y., Cook, B., Dai, L. Y., Hameed Badawy, A.-H., Glick, M., Wang, Y., Bergman, K., & Shalf, J. (2023) · 2023 IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster52292.2023.00021 · Cited by 13
Metadata
- Authors
- Grauer-Gray, S., Xu, L., Searles, R., Ayalasomayajula, S., & Cavazos, J.
- Venue
- 2012 Innovative Parallel Computing (InPar)
- Publisher
- IEEE
- Published
- 2012-05
- Pages
- 1-10
- OpenAlex
- W2128120785
- Cited by
- 470
- References
- 33
- FWCI
- 15.52
- 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.