Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles

Authors:
D. S. Meliksetian;C. Y. R. Chen
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1993

Citing 2
Cited 5

Evaluation of On-Chip Static Interconnection Networks

IEEE Transactions on Computers
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM

Periodically Regular Chordal Rings

IEEE Transactions on Parallel and Distributed Systems
A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes

ICPP '97 Proceedings of the international Conference on Parallel Processing
Communication Models for a Free-Space Optical Cross-Connect Switch

The Journal of Supercomputing
Concentration, load balancing, partial permutation routing, and superconcentration on cube-connected cycles parallel computers

Journal of Parallel and Distributed Computing
The dragon graph: a new interconnection network for high speed computing

PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.