Fault-tolerant cycle embedding in dual-cube with node faulty

Author

Li, Yumin ; Peng, Shetung ; Chu, Wunming

Author_Institution

Dept. of Comput. Sci., Hosei Univ., Tokyo, Japan

fYear

2003

fDate

27-29 Aug. 2003

Firstpage

71

Lastpage

75

Abstract

A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2^m+1 clusters and hence the total number of nodes is 2^2m+1 in a DC(m). By using Gray code, we show that a DC(m) is (m-1)-link Hamiltonian and there exists a faulty-free cycle containing at least 2^2m+1-2f nodes with f≤m-1 faulty nodes.

Keywords

Gray codes; fault tolerant computing; multiprocessor interconnection networks; Gray code; Hamiltonian cycle; dual-cube network; fault-free cycle; fault-tolerant cycle embedding; faulty node; hypercube; interconnection network; low-degree dual-cube; Algorithm design and analysis; Computer networks; Computer science; Concurrent computing; Fault tolerance; Hypercubes; Joining processes; Multiprocessor interconnection networks; Reflective binary codes; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Print_ISBN

0-7803-7840-7

Type

conf

DOI

10.1109/PDCAT.2003.1236261

Filename

1236261