Permutation routing in 2-stage recirculating delta networks

Permutation routing in 2-stage recirculating delta networks

The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Alleyne, B.D., Scherson, I.D.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Intelligent networks
Labeling
Routing
Runtime
Switches
Wires
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping to Clos networks is considered.< >
DOI:10.1109/FMPC.1992.234872