Minimizing Communications with Q-transformations in Uniform and Affine Stencils

Meneghin, Massimiliano and Vanneschi, Marco (2009) Minimizing Communications with Q-transformations in Uniform and Affine Stencils. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

Other (GZip) Available under License Creative Commons Attribution No Derivatives. Download (1659Kb)

Abstract

In stencil based parallel applications, communications represent the main overhead, especially when targeting a fine grain parallelization in order to reduce the completion time. Techniques that minimize the number and the impact of communications are clearly relevant. In literature the best optimization reduces the number of communications per step from <span style="font-style: italic;">3</span><sup style="font-style: italic;">dim</sup>, featured by a naive implementation, to <span style="font-style: italic;">2*dim</span>, where <span style="font-style: italic;">dim</span> is the number of the domain dimensions. To break down the previous bound, in the paper we introduce and formally prove <span style="font-style: italic;">Q-transformations</span>, for stencils featuring data dependencies that can be expressed as geometric affine translations. <span style="font-style: italic;">Q-transformations</span>, based on data dependencies orientations though space translations, lowers the number of communications per step to <span style="font-style: italic;">dim</span>.

Repository staff only actions