Title :
The maximum dimensional fault-free subcube allocatable in faulty hypercube
Author :
Masuyama, Hiroshi ; Sasama, Toshihiko ; Hashimoto, Hiroyuki
Author_Institution :
Inf. & Knowledge Eng., Tottori Univ., Japan
Abstract :
The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional fault-free subcube in the hypercube, that is, helps in achieving graceful and the most effective degradation of the system. The paper presents the maximum number of faults on an n-cube on which there always exists at least one fault-free (n-2)-subcube
Keywords :
fault tolerant computing; hypercube networks; parallel algorithms; degradation; fault-free (n-2)-subcube; faulty hypercube; maximum dimensional fault-free subcube; n-cube; parallel algorithms; reconfiguration problem; Binary trees; Computer networks; Degradation; Fault diagnosis; Fault tolerance; Hypercubes; Knowledge engineering; Parallel algorithms; Partitioning algorithms;
Conference_Titel :
Computer Communications and Networks, 1995. Proceedings., Fourth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
0-8186-7180-7
DOI :
10.1109/ICCCN.1995.540122
