GPGPU Kernel Implementation and Refinement using Obsidian
Paper i proceeding, 2010

Obsidian is a domain specific language for data-parallel programming on graphics processors (GPUs). It is em- bedded in the functional programming language Haskell. The user writes code using constructs familiar from Haskell (like map and reduce), recursion and some specially designed combinators for combining GPU programs. NVIDIA CUDA code is generated from these high level descriptions, and passed to the nvcc compiler [1]. Currently, we consider only the generation of single kernels, and not their coordination. This paper is focussed on how the user should work with Obsidian, starting with an obviously correct (or well- tested) description of the required function, and refining it by the introduction of constructs to give finer control of the computation on the GPU. For some combinators, this approach results in CUDA code with satisfactory performance, promising increased productivity, as the high level descriptions are short and uncluttered. But for other combinators, the performance of generated code is not yet satisfactory. Ways to tackle this problem and plans to integrate Obsidian with another higher-level embedded language for GPU programming in Haskell are briefly discussed.

GPUs

GPGPU

Haskell

Embedded language

Data-parallel

Författare

Joel Bo Svensson

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Mary Sheeran

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

ICCS 2010 conference proceedings; Amsterdam, NETHERLANDS, MAY 31-JUN 02, 2010

1877-0509 (eISSN)

Vol. 1 1 2059-2068

Ämneskategorier

Datorteknik

Programvaruteknik

Datavetenskap (datalogi)

DOI

10.1016/j.procs.2010.04.231