Fault-tolerant cycle embedding in dual-cube with node faults
by Yamin Li, Shietung Peng, Wanming Chu
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 3, No. 1, 2005

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.

Online publication date: Wed, 28-Sep-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com