Abstract / Description of output
The freedom to reorder computations involving associative operators has been widely recognized and exploited in designing parallel algorithms and to a more limited extent in optimizing compilers.
In this paper, we develop a novel framework utilizing the associativity and commutativity of operations in regular loop computations to enhance register reuse. Stencils represent a particular class of important computations where the optimization framework can be applied to enhance performance. We show how stencil operations can be implemented to better exploit register reuse and reduce load/stores. We develop a multi-dimensional retiming formalism to characterize the space of valid implementations in conjunction with other program transformations. Experimental results demonstrate the effectiveness of the framework on a collection of high-order stencils.
In this paper, we develop a novel framework utilizing the associativity and commutativity of operations in regular loop computations to enhance register reuse. Stencils represent a particular class of important computations where the optimization framework can be applied to enhance performance. We show how stencil operations can be implemented to better exploit register reuse and reduce load/stores. We develop a multi-dimensional retiming formalism to characterize the space of valid implementations in conjunction with other program transformations. Experimental results demonstrate the effectiveness of the framework on a collection of high-order stencils.
| Original language | English |
|---|---|
| Pages (from-to) | 65-76 |
| Number of pages | 12 |
| Journal | ACM Sigplan Notices |
| Volume | 49 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 9 Jun 2014 |
| Event | 35th annual ACM SIGPLAN conference on Programming Language Design and Implementation - Edinburgh, United Kingdom Duration: 9 Jun 2014 → 11 Jun 2014 http://conferences.inf.ed.ac.uk/pldi2014/ |