DocumentCode
2089032
Title
Broadcasting in injured hypercubes using limited global information
Author
Wu, Jie
Author_Institution
Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA
fYear
1994
fDate
10-13 Apr 1994
Firstpage
343
Lastpage
347
Abstract
We propose a fault-tolerant broadcasting algorithm in hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure which keeps the simplicity of conventional binomial tree-based broadcasting. Each node keeps limited information of nearby faulty links in terms of faulty adjacent subcubes. It is shown that under most circumstances, a broadcasting can be completed optimally in n steps except for a few cases with low probability which require n+1 steps
Keywords
broadcasting; fault tolerant computing; hypercube networks; tree data structures; conventional binomial tree-based broadcasting; extended spanning binomial tree structure; fault-tolerant broadcasting algorithm; faulty adjacent subcubes; faulty links; injured hypercubes; limited global information; link faults; Broadcasting; Casting; Computer science; Databases; Fault tolerance; History; Hypercubes; Linear programming; Routing; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Southeastcon '94. Creative Technology Transfer - A Global Affair., Proceedings of the 1994 IEEE
Conference_Location
Miami, FL
Print_ISBN
0-7803-1797-1
Type
conf
DOI
10.1109/SECON.1994.324332
Filename
324332
Link To Document