A Framework for Enhancing Data Reuse via Associative Reordering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

A Framework for Enhancing Data Reuse via Associative Reordering


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.
No file

Dates and versions

hal-01016093 , version 1 (27-06-2014)



Kevin Stock, Martin Kong, Tobias Grosser, Louis-Noël Pouchet, Fabrice Rastello, et al.. A Framework for Enhancing Data Reuse via Associative Reordering. PLDI '14 - 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, Jun 2014, Edinburgh, United Kingdom. pp.65-76, ⟨10.1145/2594291.2594342⟩. ⟨hal-01016093⟩
275 View
0 Download



Gmail Facebook Twitter LinkedIn More