OPTIMAL ROUTING ALGORITHM AND THE DIAMETER OF THE CUBE-CONNECTED CYCLES

Authors
MELIKSETIAN DS CHEN CYR
Citation
Ds. Meliksetian et Cyr. Chen, OPTIMAL ROUTING ALGORITHM AND THE DIAMETER OF THE CUBE-CONNECTED CYCLES, IEEE transactions on parallel and distributed systems, 4(10), 1993, pp. 1172-1178
Citations number
11
Categorie Soggetti
System Science","Computer Applications & Cybernetics","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on parallel and distributed systems → ACNP
ISSN journal
10459219
Volume
4
Issue
10
Year of publication
1993
Pages
1172 - 1178
Database
ISI
SICI code
1045-9219(1993)4:10<1172:ORAATD>2.0.ZU;2-B
Abstract
Communication between processors is one of the most important issues i n parallel and distributed systems. In this paper we study the communi cation aspects of a well known multiprocessor structure, the Cube-Conn ected Cycles (CCC). Only nonoptimal routing algorithms and bounds on t he diameter of restricted subclasses of the CCC have been presented in earlier work. In this paper, we present an optimal routing algorithm for the general CCC, with a formal proof of its optimality. Based on t his routing algorithm, we derive the exact network diameter for the ge neral CCC.