A general methodology of partitioning and mapping for given regulararrays |
| |
Authors: | Xian Chen Megson GM |
| |
Affiliation: | Kent Univ., Canterbury; |
| |
Abstract: | 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 |
| |
Keywords: | |
|
|