Issue No.10 - October (1995 vol.6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.473518
<p><it>Abstract</it>—A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expressed as computation graphs onto a given regular array is proposed. Deriving and based on a set of canonical dependencies together with two models of space projection, we give a general method of parallelization. The method has significant advantages in mapping an arbitrary computation graph onto a given processor array while preserving high efficiency in both communication and computation.</p>
Algorithm transformation, automatic compilation, given-shape and fixed-mesh partitioning, uniform recurrence equation.
Xian Chen, Graham M. Megson, "A General Methodology of Partitioning and Mapping for Given Regular Arrays", IEEE Transactions on Parallel & Distributed Systems, vol.6, no. 10, pp. 1100-1107, October 1995, doi:10.1109/71.473518