A new memory-saving technique to map system of affine recurrence equations (SARE) onto distributed memory systems
Alessandro Marongiu, Paolo Palazzari · 2003
In this work we present a procedure for automatic parallel code generation in the case of algorithms described through Set of Affine Recurrence Equations (SARE); starting from the original SARE description in an N-dimensional iteration space, the algorithm is converted into a parallel code for an m-dimensional distributed memory parallel machine (m