Effective automatic parallelization of stencil computations
2007pp. 235–244
Citations Over TimeTop 10% of 2007 papers
Sriram Krishnamoorthy, Muthu Manikandan Baskaran, Uday Bondhugula, J. Ramanujam, Atanas Rountev, P. Sadayappan
Abstract
Performance optimization of stencil computations has been widely studied in the literature, since they occur in many computationally intensive scientific and engineering applications. Compiler frameworks have also been developed that can transform sequential stencil codes for optimization of data locality and parallelism. However, loop skewing is typically required in order to tile stencil codes along the time dimension, resulting in load imbalance in pipelined parallel execution of the tiles. In this paper, we develop an approach for automatic parallelization of stencil codes, that explicitly addresses the issue of load-balanced execution of tiles. Experimental results are provided that demonstrate the effectiveness of the approach.
Related Papers
- → Advanced loop optimizations for parallel computers(1988)24 cited
- → Overcoming the limitations of the traditional loop parallelization(1997)11 cited
- → Improving Locality in the Parallelization of Doacross Loops(2002)1 cited
- Comparative Cross-Platform Performance Results from a Parallelizing SML Compiler(2001)
- → On the Transformation Optimization for Stencil Computation(2021)