Title :
Fault diameter and fault tolerance of HCN(n,n)
Author :
Hyeong-Ok, Lee ; Jung-Hoi, Hur ; Hee-Chang, Chuug ; Chung-Ho, Cho
Author_Institution :
Nat. Comput. Agency, South Korea
Abstract :
We provide the way to make an n+1 node disjoint parallel path between any two nodes of HCN(n,n) which has a better network cost than the hypercube, and prove that the fault diameter of HCN(n,n) is dia(HCN(n,n))+4 by result. These parallel paths can reduce the time of transmitting messages between nodes, and they mean that if some nodes of HCN(n,n) would fail, there is still no communication delay time. Also, by analyzing the fault tolerance of the interconnection network HCN(n,n), we prove that there is maximal fault tolerance
Keywords :
fault tolerant computing; message passing; multiprocessor interconnection networks; parallel architectures; HCN(n,n); communication delay; disjoint parallel path; fault diameter; fault tolerance; hypercube; message passing; multiprocessor interconnection network; Application software; Computer networks; Concurrent computing; Costs; Delay effects; Electronic mail; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Parallel processing;
Conference_Titel :
Parallel and Distributed Systems, 2001. ICPADS 2001. Proceedings. Eighth International Conference on
Conference_Location :
Kyongju City
Print_ISBN :
0-7695-1153-8
DOI :
10.1109/ICPADS.2001.934839
