We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n -1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same
โฆ LIBER โฆ
Fault tolerant wormhole routing in hypercube multicomputers
โ Scribed by C.S. Yang; Y.M. Tsai; R.L. Wu
- Publisher
- Elsevier Science
- Year
- 1992
- Weight
- 348 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0165-6074
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Fault-tolerant wormhole routing for hype
โ
Jau-Der Shih
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 145 KB
Adaptive Wormhole Routing in Hypercube M
โ
X. Lin; A-H. Esfahanian; A. Burago
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 186 KB
Fault-tolerant message routing in the ex
โ
M.J. Kumar; L.M. Patnaik; B. Nag
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 913 KB
Multi-phase minimal fault-tolerant wormh
โ
Jipeng Zhou; Francis C.M. Lau
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 343 KB
Fault-Tolerant Permutation Routing in Hy
โ
Mee Yee Chan; Shiang-Jen Lee
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 408 KB
A fault-tolerant routing algorithm for w
โ
Pao-Hwa Sui; Sheng-De Wang
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 145 KB
We investigate fault-tolerant routing schemes which aim at using low number of virtual channels in wormhole-routed mesh networks. The faults under consideration are rectangular block faults, which are suitable for modeling faults on board level in networks with grid structures. There is no restricti