High Order Stencil Transformation Suite
(Correct link for prototype code) |
(→Overview: based on abstract) |
||
| Line 1: | Line 1: | ||
== Overview == | == Overview == | ||
| − | These tools . | + | These tools utilize |
| + | associativity and commutativity of operations in regular loop computations | ||
| + | to enhance stencil computations. By aggressively reordering accumulations | ||
| + | to the output of a stencil using multi-dimensional retiming, better register | ||
| + | reuse is achieved and the total load/store operations required per pixel is significantly reduced. | ||
== People == | == People == | ||
Revision as of 23:43, 27 March 2014
Contents |
Overview
These tools utilize associativity and commutativity of operations in regular loop computations to enhance stencil computations. By aggressively reordering accumulations to the output of a stencil using multi-dimensional retiming, better register reuse is achieved and the total load/store operations required per pixel is significantly reduced.
People
- Kevin Stock
- Martin Kong
- Tobias Grosser
- Louis-Noël Pouchet
- Fabrice Rastello
- J. Ramanujam
- P. Sadayappan
Publications
A Framework for Enhancing Data Reuse via Associative Reordering
Kevin Stock, Martin Kong, Tobias Grosser, Louis-Noël Pouchet, Fabrice Rastello, J. Ramanujam, and P. Sadayappan
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'14), June 2014.
Downloads
The recent version of the code can be downloaded from the following location:
Please see the included README file for installation instructions. For questions or comments, contact Kevin Stock.
Acknowledgements
This work was supported in part by the U.S. National Science Foundation through awards 0811457, 0904549, 0926127, 1059417 and 1321147, by the U.S. Department of Energy through award DE-SC0008844, and a Google European Fellowship in Efficient Computing.
