Compact data structure and scalable algorithms for the sparse grid technique
Technische Universitat Munchen, Garching, Germany
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, PPoPP ’11, 2011
@inproceedings{murarasu2011compact,
title={Compact data structure and scalable algorithms for the sparse grid technique},
author={Murarasu, A. and Weidendorfer, J. and Buse, G. and Butnaru, D. and Pfl{\"u}ger, D.},
booktitle={Proceedings of the 16th ACM symposium on Principles and practice of parallel programming},
pages={25–34},
year={2011},
organization={ACM}
}
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data structures, thus being far from well-suited for GPUs. In this paper, we describe optimizations that enable us to implement compression and decompression, the crucial sparse grid algorithms for our application, on Nvidia GPUs. The main idea consists of a bijective mapping between the set of points in a multi-dimensional sparse grid and a set of consecutive natural numbers. The resulting data structure consumes a minimum amount of memory. For a 10-dimensional sparse grid with approximately 127 million points, it consumes up to 30 times less memory than trees or hash tables which are typically used. Compared to a sequential CPU implementation, the speedups achieved on GPU are up to 17 for compression and up to 70 for decompression, respectively. We show that the optimizations are also applicable to multicore CPUs.
September 23, 2011 by hgpu
