|
Title:
|
DESIGNING FAULT-TOLERANT MESHES USING CIRCULANT GRAPHS |
|
Author(s):
|
Abdel Aziz Farrag , Shituo Lou |
|
ISBN:
|
972-98947-3-6 |
|
Editors:
|
Nuno Guimarães and Pedro Isaías |
|
Year:
|
2004 |
|
Edition:
|
Single |
|
Keywords:
|
Algorithms, parallel architectures, networks, fault-tolerant extensions, circulant graphs, meshes. |
|
Type:
|
Full Paper |
|
First Page:
|
1026 |
|
Last Page:
|
1035 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Recently, circulant graphs have received a lot of attention; and a new method was proposed for designing fault-tolerant solutions for any circulant graph. This method works by partitioning the offsets of the graph in many ways; each leads to one or more solutions. By comparing these solutions, we can find the one with the least
node-degree. In this paper, we shall first review this method; and then re-examine its applications to the design of k-fault-tolerant meshes for all possible values of k. Our results demonstrate that the solutions obtained for both 2 and
3-dimensional meshes are efficient. |
|
|
|
|
|
|
