Partitioning message patterns for bundled omega networks

Considers a strategy for dealing with communication conflicts in omega networks. Specifically, the authors consider the problem of partitioning a set of conflicting messages into a minimum number of subsets, called rounds, each free of communication conflicts. In addition to standard omega networks,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on parallel and distributed systems 1994-04, Vol.5 (4), p.353-363
Hauptverfasser:	Bernhard, P.J., Rosenkrantz, D.J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Circuits Communication switching Computational complexity Computer science Hypercubes Polynomials Routing Sorting Telephony Wires
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!