By Topic

Incomplete Star Graph : An Economical Fault-tolerant Interconnection Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
CP. Ravikumar ; Indian Institute of Technology- ; A. Kuchlous ; G. Manimaran

A number of existing multiprocessors are based on the hypercube interconnection network. The popularity of the hypercube is due to its small communication diameter, which grows logarithmically with the cube size, its fault-tolerant properties, and its modularity which makes it possible to build a larger cube from smaller subcubes. The star graph has been studied as a network topology for fault-tolerant parallel com puting. Unfortunately, the size of the network grows too sharply with n to be affordable for values of n larger than 7 or 8. We introduce a novel intercon nection network known as the incomplete star graph, which overcomes the above problem while retaining the most of the advantages of the star graph. We present the architecture of the incomplete star graph and compare its performance with the full star as well as competing architectures such as the incomplete hy¿ percube and arrangement graphs. We provide routing algorithms for both non-faulty and faulty incompletestar graphs, and study their performance.

Published in:

Parallel Processing, 1993. ICPP 1993. International Conference on  (Volume:1 )

Date of Conference:

16-20 Aug. 1993