Fault tolerance of möbius cubes under two forbidden fault set models

International Journal of Computer Mathematics

Volumn 81, Issue 8, 2004, Pages 909-916

  Yang, Xiaofan ^a,b   Megson, Graham M ^c  

^a College of Computer Science ^*

^b CHONGQING UNIVERSITY   (China)

^c UNIVERSITY OF READING   (United Kingdom)

Author keywords

Connectivity; Fault tolerance; Forbidden fault set model; M bius cube; Multiprocessor system

Indexed keywords

COMMUNICATION SYSTEMS; EMBEDDED SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY;

CONNECTIVITY; FORBIDDEN FAULT SET MODEL; MÖBIUS CUBE; MULTIPROCESSOR SYSTEM;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 26444524529     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160410001712332     Document Type: Article

References (13)

1. Chen, T. H. (1992). Fault Diagnosis and Fault Tolerance - A Systematic Approach to Special Topics. Springer-Verlag, Berlin.
2. Parhami, B. (1999). An Introduction to Parallel Processing: Algorithms and Architectures. Plenum Press.
3. Cull, P. and Larson, S. M. (1995). The Möbius cubes. IEEE Trans. Comput., 44(May), 647-659.
4. Rouskov, Y., Latifi, S. and Somani, P. K. (1996). Conditional fault diameter of star graph networks. J. Parallel Distrib. Comput., 33(Jan.), 91-97.
5. Fan, J. (1998). Diagnosability of the Möbius cubes. IEEE Trans. Parallel Distrib. Syst., 9(Sept.), 923-928.
6. Fan, J. (2002). Hamiltonian-connectivity and cycle-embedding of the Möbius cubes. Inform. Process. Lett., 82(Feb.), 113-117.
7. Huang, W. T., Chuang, Y. C., Jim, J. and Hsu, L. H. (2000). Fault-free hamiltonian cycle in faulty Möbius cubes. Comput. Siste., 4(Feb.), 106-114.
8. Hayes, J. P. (1976). A graph model for fault-tolerant computing systems. IEEE Trans. Comput., C-25(Sep.), 875-884.
9. Ponnuswamy, S. and Chaudhary, V. (1993). Analysis of fault tolerance in Cayley digraphs using forbidden faulty sets, Technical report TR-93-22-22. Department of Electrical and Computer Engineering, Wayne State University [www http://www.pdcl.eng.wayne.edu/reports.html].
10. Pradhan, D. K. and Reddy, S. M. (1982). A fault-tolerant communication architecture for distributed systems. IEEE Trans. Comput., C-31(Sep.). 863-869.
11. Esfahanian, A. H. (1989). Generalized measures of fault tolerance with application to N-cube networks. IEEE Trans. Comput., 38(Nov.), 1586-1691.
12. Harary, F. (1969). Graph Theory. Addison-Wesley, Reading, MA.
13. Lu, K. (1999). Combinatorial Mathematics. Tsinghua University Press (in Chinese).