Title :
A general methodology of partitioning and mapping for given regular arrays
Author :
Chen, Xian ; Megson, Graham M.
Author_Institution :
Kent Univ., Canterbury, UK
fDate :
10/1/1995 12:00:00 AM
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; Computer architecture; Computer science; Concurrent computing; Difference equations; Helium; Processor scheduling; Topology;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
