ACM Home Page
Please provide us with feedback. Feedback
Fault-tolerance and reconfiguration of circulant graphs and hypercubes
Full text PdfPdf (97 KB)
Source
Spring Simulation Multiconference archive
Proceedings of the 2008 Spring simulation multiconference table of contents
Ottawa, Canada
SESSION: 2008 high performance computing symposium (HPC'08): High performance computing and simulation algorithms table of contents
Pages 475-481  
Year of Publication: 2008
ISBN:1-56555-319-5
Authors
Abdel Aziz Farrag  Dalhousie University, Halifax, NS, Canada
Shituo Lou  Dalhousie University, Halifax, NS, Canada
Yao Qi  Dalhousie University, Halifax, NS, Canada
Sponsors
SIGSIM: ACM Special Interest Group on Simulation and Modeling
(SCS) : The Society for Modeling and Simulation International
Publisher
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Several interconnection networks (such as rings, meshes and hypercubes) can be modeled as circulant graphs. As a result, methods previously developed for constructing fault-tolerant solutions of circulant graphs can also be applied to these networks. Among these methods, the one based on the idea of "offsets partitioning" is the most efficient (for circulant graphs). We review this method in this paper, and extend its applications to hypercubes. Moreover, we develop new algorithms to reconfigure circulant graphs and hypercubes. Our results show that the fault-tolerant solutions obtained, and the reconfiguration algorithms developed are efficient.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
Chung, F., F. Leighton, and A. Rosenberg, 1983, "Diogenes: a Methodology for Designing Fault-Tolerant VLSI Processor Arrays", in Proc. IEEE 13th Conf on Fault Tolerant Computing Symp, (June), Chicago, IL, 26--32.
 
6
 
7
 
8
 
9
 
10
 
11
Farrag, A., and S. Lou, 2005, "Applying Fault-Tolerant Solutions of Circulant Graphs to Multi-Dimensional Meshes" in Computers & Mathematics Journal, 50, no. 8--9, (November): 1383--1394.
 
12
Harary, F., and J. Hayes, 1993, "Edge Fault Tolerance of Graphs", in Networks, 23, no. 2 (March): 135--142.
 
13
Li, Y., S. Peng and W. Chu, 2003, "Fault-Tolerant Cycle Embedding in Dual-Cube with Node Faulty", in Proc. Int Conf on Parallel and Dist. Computing, (August 27--29), Chengdu, China, 71--75.
 
14
Lipson, J., 1981, Elements of Algebra and Algebraic Computing, Benjamin/Cummings Publisher, Melno Park, California.
 
15
Rennels, D., 1986, "On Implementing Fault-Tolerance in Binary Hypercubes", Digest of papers of IEEE Symp on Fault-Tolerant Comp, (July), Vienna, Austria, 344--349.
 
16
 
17
 
18
 
19
 
20
 
21

Collaborative Colleagues:
Abdel Aziz Farrag: colleagues
Shituo Lou: colleagues
Yao Qi: colleagues