Block-asynchronous Multigrid Smoothers for GPU-accelerated Systems
Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany
Innovative Computing Laboratory, University of Tennessee, Technical report UT-CS-11-689, 2011
@techreport{anzt2011block,
title={Block-asynchronous Multigrid Smoothers for GPU-accelerated Systems},
author={Anzt, H. and Tomov, S. and Gates, M. and Dongarra, J. and Heuveline, V.},
year={2011},
institution={Technical report, Innovative Computing Laboratory, University of Tennessee, UT-CS-11-689}
}
This paper explores the need for asynchronous iteration algorithms as smoothers in multigrid methods. The hardware target for the new algorithms is top-of-the-line, highly parallel hybrid architectures – multicore-based systems enhanced with GPGPUs. These architectures are the most likely candidates for future highend supercomputers. To pave the road for their efficient use, we must resolve challenges related to the fact that data movement, not floating-point operations, is the bottleneck to performance. Our work is in this direction – we designed block-asynchronous multigrid smoothers that perform more flops in order to reduce synchronization, and hence data movement. We show that the extra flops are done for "free," while synchronization is reduced and the convergence properties of multigrid with classical smoothers like Gauss-Seidel can be preserved.
January 8, 2012 by hgpu
