A language for hierarchical data parallel design-space exploration on GPUs. (17th March 2016)

• Record Type: Journal Article
• Authors: SVENSSON, BO JOEL; NEWTON, RYAN R.; SHEERAN, MARY
• Is Part Of: Journal of functional programming. Volume 26(2016)
• Publication Date: 2016-03-17
• Subjects: Functional programming (Computer science) -- Periodicals
• DOI: 10.1017/S0956796816000046
• Languages: English
• ISSNs: 0956-7968

Abstract

Abstract: Graphics Processing Units (GPUs) offer potential for very high performance; they are also rapidly evolving. Obsidian is an embedded language (in Haskell) for implementing high performance kernels to be run on GPUs. We would like to have our cake and eat it too; we want to raise the level of abstraction beyond CUDA code and still give the programmer control over the details relevant to kernel performance. To that end, Obsidian provides array representations that guarantee elimination of intermediate arrays while also using the type system to model the hierarchy of the GPU. Operations are compiled very differently depending on what level of the GPU they target, and as a result, the user is gently constrained to write code that matches the capabilities of the GPU. Thus, we implement not Nested Data Parallelism, but a more limited form that we call Hierarchical Data Parallelism. We walk through case-studies that demonstrate how to use Obsidian for rapid design exploration or auto-tuning, resulting in performance that compares well to the hand-tuned kernels used in Accelerate and NVIDIA Thrust.