The Community for Technology Leaders
Green Image
<p>Communication between processors is one of the most important issues in parallel anddistributed systems. The authors study the communication aspects of a well knownmultiprocessor structure, the cube-connected cycles (CCC). Only nonoptimal routingalgorithms and bounds on the diameter of restricted subclasses of the CCC have beenpresented 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.</p>
Index Termsoptimal routing algorithm; diameter; cube-connected cycles; multiprocessor structure;exact network diameter; fault tolerant computing; hypercube networks; performanceevaluation

D. Meliksetian and C. Chen, "Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1172-1178, 1993.
93 ms
(Ver 3.3 (11022016))