EPSILOD: efficient parallel skeleton for generic iterative stencil computations in distributed GPUs

Abstract

Iterative stencil computations are widely used in numerical simulations. They present a high degree of parallelism, high locality and mostly-coalesced memory access patterns. Therefore, GPUs are good candidates to speed up their computation. However, the development of stencil programs that can work with huge grids in distributed systems with multiple GPUs is not straightforward, since it requires solving problems related to the partition of the grid across nodes and devices, and the synchronization and data movement across remote GPUs. In this work, we present EPSILOD, a high-productivity parallel programming skeleton for iterative stencil computations on distributed multi-GPUs, of the same or different vendors that supports any type of n-dimensional geometric stencils of any order. It uses an abstract specification of the stencil pattern (neighbors and weights) to internally derive the data partition, synchronizations and communications. Computation is split to better overlap with communications. This paper describes the underlying architecture of EPSILOD, its main components, and presents an experimental evaluation to show the benefits of our approach, including a comparison with another state-of-the-art solution. The experimental results show that EPSILOD is faster and shows good strong and weak scalability for platforms with both homogeneous and heterogeneous types of GPU.

Optimizing Three-Dimensional Stencil-Operations on Heterogeneous Computing Environments

“…Unfortunately, the experiment section does not discuss the use of multiple GPUs [14]. EPSILOD tests prototypes for stencil operations but misses a generic stencil implementation [15]. ExaStencil provides a domain-specific language for stencil operations, therefore it misses the option to parallelize pre-and post-processing steps [16].…”