The Community for Technology Leaders
RSS Icon
Subscribe
Kyongju City, South Korea
June 29, 2001 to June 29, 2001
ISBN: 0-7695-1153-8
pp: 0346
Lee Hyeong-Ok , National Computerization Agency
Hur Jung-Hoi , National Computerization Agency
Chung Hee-Chang , National Computerization Agency
Cho Chung-Ho , Kwangju University
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.
CITATION
Lee Hyeong-Ok, Hur Jung-Hoi, Chung Hee-Chang, Cho Chung-Ho, "Fault Diameter and Fault Tolerance of HCN(n,n)", ICPADS, 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 2001, pp. 0346, doi:10.1109/ICPADS.2001.934839
8 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool