| Title | A general methodology of partitioning and mapping for given regular arrays |
|---|
| Authors | Chen, X. and Megson, G.M. |
|---|
| 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 | Parallel algorithms, systolic arrays, arbitrary computation graph, arbitrary uniform recurrence equations, canonical dependencies, computation graphs, general methodology mapping, parallelization, partitioning, processor array, regular array, regular arrays |
|---|
| Journal | IEEE Transactions on Parallel and Distributed Systems |
|---|
| Journal citation | 6 (10), pp. 1100-1107 |
|---|
| ISSN | 1045-9219 |
|---|
| Year | Oct 1995 |
|---|
| Publisher | IEEE |
|---|
| Digital Object Identifier (DOI) | https://doi.org/10.1109/71.473518 |
|---|
| Publication dates |
|---|
| Published | Oct 1995 |
|---|