The Community for Technology Leaders
Parallel and Distributed Systems, International Conference on (2001)
Kyongju City, Korea
June 26, 2001 to June 29, 2001
ISBN: 0-7695-1153-8
pp: 0346
Cho Chung-Ho , Kwangju University
Lee Hyeong-Ok , National Computerization Agency
Hur Jung-Hoi , National Computerization Agency
Chung Hee-Chang , National Computerization Agency
ABSTRACT
Abstract: In this paper, we will provide the way to make n+1 node disjoint parallel path between any two node of HCN(n,n) which is better network cost than hypercube, and will 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 interconnection network HCN(n,n), we will prove that there is maximally fault tolerance.
INDEX TERMS
CITATION
Cho Chung-Ho, Lee Hyeong-Ok, Hur Jung-Hoi, Chung Hee-Chang, "Fault Diameter and Fault Tolerance of HCN(n,n)", Parallel and Distributed Systems, International Conference on, vol. 00, no. , pp. 0346, 2001, doi:10.1109/ICPADS.2001.934839
91 ms
(Ver )