Fault-tolerant cycle embedding in dual-cube with node faults. (29th September 2005)

• Record Type: Journal Article
• Authors: Li, Yamin; Peng, Shietung; Chu, Wanming
• Is Part Of: International journal of high performance computing and networking. Volume 3:Number 1(2005)
• Page Start: 45
• Page End: 53
• Publication Date: 2005-09-29
• Subjects: interconnection networks -- hypercubes -- Gray code -- Hamiltonian cycle -- fault-tolerant embedding -- cycle embedding -- dual-cube -- node faults -- high performance computing -- networking; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

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 in a DC(m) is 2 2m+1 . In this paper, by using Gray code, we show that there exists a fault-free cycle containing at least 2 2m+1 –2f nodes in DC(m), m≥3, with f≤m faulty nodes.