Optimal routing algorithm and the diameter of the cube-connected cycles

Optimal routing algorithm and the diameter of the cube-connected cycles

Communication between processors is one of the most important issues in parallel and distributed systems. The authors study the communication aspects of a well known multiprocessor structure, the cube-connected cycles (CCC). Only nonoptimal routing algorithms and bounds on the diameter of restricted...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems 1993-10, Vol.4 (10), p.1172-1178
Hauptverfasser: Meliksetian, D.S., Chen, C.Y.R.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Distributed algorithms
Exact sciences and technology
Hardware
Hypercubes
Multiprocessing systems
Multiprocessor interconnection networks
Performance analysis
Routing
Software
Systolic arrays
Very large scale integration
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Communication between processors is one of the most important issues in parallel and distributed systems. The authors study the communication aspects of a well known multiprocessor structure, the cube-connected cycles (CCC). Only nonoptimal routing algorithms and bounds on the diameter of restricted subclasses of the CCC have been presented in earlier work. The authors present an optimal routing algorithm for the general CCC, with a formal proof of its optimality. Based on this routing algorithm, they derive the exact network diameter for the general CCC.< >
ISSN:1045-9219
1558-2183
DOI:10.1109/71.246078