Optimization Techniques for Dimensionally Truncated Sparse Grids on Heterogeneous Systems
KAUST Grant NumberUK-C0020
Permanent link to this recordhttp://hdl.handle.net/10754/599103
MetadataShow full item record
AbstractGiven the existing heterogeneous processor landscape dominated by CPUs and GPUs, topics such as programming productivity and performance portability have become increasingly important. In this context, an important question refers to how can we develop optimization strategies that cover both CPUs and GPUs. We answer this for fastsg, a library that provides functionality for handling efficiently high-dimensional functions. As it can be employed for compressing and decompressing large-scale simulation data, it finds itself at the core of a computational steering application which serves us as test case. We describe our experience with implementing fastsg's time critical routines for Intel CPUs and Nvidia Fermi GPUs. We show the differences and especially the similarities between our optimization strategies for the two architectures. With regard to our test case for which achieving high speedups is a "must" for real-time visualization, we report a speedup of up to 6.2x times compared to the state-of-the-art implementation of the sparse grid technique for GPUs. © 2013 IEEE.
CitationDeftu A, Murarasu A (2013) Optimization Techniques for Dimensionally Truncated Sparse Grids on Heterogeneous Systems. 2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing. Available: http://dx.doi.org/10.1109/PDP.2013.57.
SponsorsThis publication is based on work supported by Award No.UK-C0020, made by King Abdullah University of Science andTechnology (KAUST).
Journal2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing