SAGE: Self-tuning approximation for graphics engines

• Published in: 2013 46th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) pp. 13 - 24
• Main Authors: Samadi, Mehrzad, Janghaeng Lee, Jamshidi, D. Anoushe, Hormati, Amir, Mahlke, Scott
• Format: Conference Proceeding
• Language: English
• Published: ACM 01-12-2013
• Subjects: Approximation; Bandwidth; Benchmark testing; Compiler; GPU; Graphics processing units; Instruction sets; Kernel; Optimization; Tuning
• DOI: 10.1145/2540708.2540711

Approximate computing, where computation accuracy is traded off for better performance or higher data throughput, is one solution that can help data processing keep pace with the current and growing overabundance of information. For particular domains such as multimedia and learning algorithms, approximation is commonly used today. We consider automation to be essential to provide transparent approximation and we show that larger benefits can be achieved by constructing the approximation techniques to fit the underlying hardware. Our target platform is the GPU because of its high performance capabilities and difficult programming challenges that can be alleviated with proper automation. Our approach, SAGE, combines a static compiler that automatically generates a set of CUDA kernels with varying levels of approximation with a run-time system that iteratively selects among the available kernels to achieve speedup while adhering to a target output quality set by the user. The SAGE compiler employs three optimization techniques to generate approximate kernels that exploit the GPU microarchitecture: selective discarding of atomic operations, data packing, and thread fusion. Across a set of machine learning and image processing kernels, SAGE's approximation yields an average of 2.5× speedup with less than 10% quality loss compared to the accurate execution on a NVIDIA GTX 560 GPU.