Parallel divide and conquer on meshes

We address the problem of mapping divide-and-conquer programs to mesh connected multicomputers with wormhole or store-and-forward routing. We propose the binomial tree as an efficient model of parallel divide-and-conquer and present two mappings of the binomial tree to the 2D mesh. Our mappings expl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems 1996-10, Vol.7 (10), p.1049-1058
Hauptverfasser:	Lo, V., Rajopadhye, S., Telle, J.A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Communication system control Computer architecture Computer science control theory systems Computer Society Computer systems and distributed systems. User interface Concurrent computing Embedded computing Exact sciences and technology Large-scale systems Office automation, teleprocessing Performance gain Problem-solving Routing Software Theoretical computing Tree graphs
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!