Title :
Optimal routing algorithm and the diameter of the cube-connected cycles
Author :
Meliksetian, Dikran S. ; Chen, C. Y Roger
Author_Institution :
Dept. of Electr. Eng., South Dakota Sch. of Mines & Technol., Rapid City, SD, USA
fDate :
10/1/1993 12:00:00 AM
Abstract :
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
Keywords :
fault tolerant computing; hypercube networks; performance evaluation; cube-connected cycles; diameter; exact network diameter; multiprocessor structure; optimal routing algorithm; Algorithm design and analysis; Distributed algorithms; Hardware; Hypercubes; Multiprocessing systems; Multiprocessor interconnection networks; Performance analysis; Routing; Systolic arrays; Very large scale integration;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
