CUDA: Compiling and optimizing for a GPU platform
Gautam Chakrabarti, Vinod Grover, Bastiaan Aarts et al. · Procedia Computer Science · 2012
Graphics processor units (GPUs) have evolved to handle throughput oriented workloads where a large number of parallel threads must make progress. Such threads are organized around shared memory making it possible to synchronize and cooperate on shared data. Current GPUs can run tens of thousands of hardware threads and have been optimized for graphics workloads. Several high level languages have been developed to easily program the GPUs for general purpose computing problems. The use of high-level languages introduces the need for highly optimizing compilers that target the parallel GPU device. In this paper, we present our experiences in developing compilation techniques for a high level language called CUDA C. We explain the CUDA architecture and programming model and provide insights into why certain optimizations are important for achieving high performance on a GPU. In addition to classical optimizations, we present optimizations developed specifically for the CUDA architecture. We evaluate these techniques, and present performance results that show significant improvements on hundreds of kernels as well as applications.
Cited by 22 works. doi:10.1016/j.procs.2012.04.209 Open-access PDF
Authors
References
- Program Slicing
- The Amber biomolecular simulation programs
- Brook for GPUs
- Optimization principles and application performance evaluation of a multithreaded GPU using CUDA
- Constant propagation with conditional branches
- Cg
- Brook for GPUs
- A Survey of Program Slicing Techniques.
- Cg
- Titanium: a high-performance Java dialect