By Topic

Algorithm for constructing fault-tolerant solutions of the circulant graph configuration

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
$31 $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

1 Author(s)
Farrag, A.A. ; Dept. of Math. & Comput. Sci., Dalhousie Univ., Halifax, NS, Canada

Recently, a general method was developed to design a k-fault-tolerant solution for any given circulant graph, where k is the number of faulty nodes to be tolerated. In this paper, a new algorithm is proposed which, (unlike the earlier method), constructs a family of k-fault-tolerant solutions, for any given circulant graph. These solutions can then be compared to select the one with the least cost. The algorithm is efficient to implement as it requires only a polynomial time (to generate and search the solutions). The proposed method is also useful to other architectures, as demonstrated in the paper. We shall examine the application of the method to the problem of designing k-fault-tolerant extensions of (2 and 3 dimensional) meshes, and show that the solutions obtained are very efficient

Published in:

Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the

Date of Conference:

6-9 Feb 1995