DocumentCode :
3438748
Title :
An efficient scheme for embedding a ring into an injured hypercube with both faulty links and faulty nodes
Author :
Tseng, Yu-Chee
Author_Institution :
Inst. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan
fYear :
1996
fDate :
19-22 Dec 1996
Firstpage :
165
Lastpage :
169
Abstract :
In this paper we show that given a binary n-cube with fe⩽n-4 faulty edges and fv⩽n-1 faulty vertices such that fe+fv⩽n-1, a ring of length at least 2n-2fv can be obtained. On the contrary, existing results can tolerate only faulty edges or only faulty vertices
Keywords :
fault tolerant computing; hypercube networks; binary n-cube; embedding; faulty edges; faulty links; faulty nodes; faulty vertices; injured hypercube; Computer science; Councils; Distributed algorithms; Fault tolerance; Hypercubes; Large-scale systems; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Computing, 1996. Proceedings. 3rd International Conference on
Conference_Location :
Trivandrum
Print_ISBN :
0-8186-7557-8
Type :
conf
DOI :
10.1109/HIPC.1996.565818
Filename :
565818
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3438748
بازگشت