Coarse-grain Parallel Execution for 2-dimensional PDE Problems

This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE problems with finite-differencing schemes. Tiling transformation is an efficient loop transformation to achieve coarse-grain parallelism in such algorithms, while rectangular tile shapes are the only feasible shapes that can be manually applied by program developers. However, rectangular tiling transformations are not always valid due to data dependencies, and thus requiring the application of an appropriate skewing transformation prior to tiling in order to enable rectangular tile shapes. We employ cyclic mapping of tiles to processes and propose a method to determine an efficient rectangular tiling transformation for a fixed number of processes for 2-dimensional, skewed PDE problems. Our experimental results confirm the merit of coarse-grain execution in this family of applications and indicate that the pr...

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Georgios I. Goumas, Nikolaos Drosinos, Vasileios Karakasis, Nectarios Koziris
• Keywords: Distributed And Parallel Computing, IPPS 2007, Rectangular Tile Shapes, Rectangular Tiling Transformation, Tiling Transformations