Automatic mapping of system of N-dimensional affine recurrence equations (SARE) onto distributed memory parallel systems
Alessandro Marongiu, Paolo Palazzari · IEEE Transactions on Software Engineering · 2000
The automatic extraction of parallelism from algorithms, and the consequent parallel code generation, is a challenging problem. We present a procedure for automatic parallel code generation in the case of algorithms described through a SARE (Set of Affine Recurrence Equations). Starting from the original SARE description in an N-dimensional iteration space, the algorithm is converted into a parallel code for an (eventually virtual) m-dimensional distributed memory parallel machine (m