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

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 a...

Full description

Saved in:
Bibliographic Details
Published inProceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation pp. 514 - 520
Main Author Farrag, A.A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1995
Subjects
Algorithm design and analysis
Application software
Concurrent computing
Costs
Fault tolerance
Fault tolerant systems
Mathematics
Multiprocessing systems
Parallel architectures
Redundancy
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:9780818669651
0818669659
DOI:10.1109/FMPC.1995.380473