Accelerating Haskell array codes with multicore GPUs
University of New South Wales, Sydney, Australia
Proceedings of the sixth workshop on Declarative aspects of multicore programming, DAMP ’11, 2011
@inproceedings{chakravarty2011accelerating,
title={Accelerating Haskell array codes with multicore GPUs},
author={Chakravarty, M.M.T. and Keller, G. and Lee, S. and McDonell, T.L. and Grover, V.},
booktitle={Proceedings of the sixth workshop on Declarative aspects of multicore programming},
pages={3–14},
year={2011},
organization={ACM}
}
Current GPUs are massively parallel multicore processors optimised for workloads with a large degree of SIMD parallelism. Good performance requires highly idiomatic programs, whose development is work intensive and requires expert knowledge. To raise the level of abstraction, we propose a domain-specific high-level language of array computations that captures appropriate idioms in the form of collective array operations. We embed this purely functional array language in Haskell with an online code generator for NVIDIA’s CUDA GPGPU programming environment. We regard the embedded language’s collective array operations as algorithmic skeletons; our code generator instantiates CUDA implementations of those skeletons to execute embedded array programs. This paper outlines our embedding in Haskell, details the design and implementation of the dynamic code generator, and reports on initial benchmark results. These results suggest that we can compete with moderately optimised native CUDA code, while enabling much simpler source programs.
August 22, 2011 by hgpu
