Distributed Processing and Fault Diameter and Fault Tolerance of Gray Cube


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 8, pp. 1930-1939, Aug. 1997
10.3745/KIPSTE.1997.4.8.1930,   PDF Download:

Abstract

In this paper, we analyze the fault diameter and fault tolerance of Gray cube proposed recently in [12]. Fault diameter of an interconnection network is one of the important network measures concerning the distance between nodes when some nodes fail. It is showed that fault diameter of n-dimensional Gray cube having 2^n nodes is (n 1)/2 2, (n%u22653). It means the increment of the longest distance between nodes under node-failure is only constant factor. Comparing the result with the fault diameter of well-known hypercube, the longest routing distance of a message in a Gray cube under node-failure is about the half of that of hypercube.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. H. Ok, J. N. Keun, L. H. Seok, "Distributed Processing and Fault Diameter and Fault Tolerance of Gray Cube," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 8, pp. 1930-1939, 1997. DOI: 10.3745/KIPSTE.1997.4.8.1930.

[ACM Style]
Lee Hyeong Ok, Joo Nak Keun, and Lim Hyeong Seok. 1997. Distributed Processing and Fault Diameter and Fault Tolerance of Gray Cube. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 8, (1997), 1930-1939. DOI: 10.3745/KIPSTE.1997.4.8.1930.