A general methodology of partitioning and mapping for given regular arrays

A general methodology of partitioning and mapping for given regular arrays

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 parallel...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems 1995-10, Vol.6 (10), p.1100-1107
Hauptverfasser: Xian Chen, Megson, G.M.
Format: Artikel
Sprache:eng
Schlagworte:
Computer architecture
Computer science
Concurrent computing
Difference equations
Processor scheduling
Topology
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
ISSN:1045-9219
1558-2183
DOI:10.1109/71.473518