Fault-tolerant wormhole routing in two-dimensional mesh networks with convex faults
Journal
Information Sciences
Journal Volume
121
Journal Issue
3
Pages
217-231
Date Issued
1999-12
Author(s)
Sui, Pao-Hwa
Abstract
Faulty blocks are expanded, by disabling nodes, to form rectangular faults in many existing works to facilitate the designing of deadlock-free routing schemes for meshes recently. In this paper, faulty blocks are diffused to be rectangular faults, which are composed of faulty and fault-diffused nodes. These rectangular faults are then shrunk, by recovering fault-diffused nodes, to form convex faults for reducing the number of nodes disabled. Simulation results show that up to 70% of the disabled nodes, which are needed to form rectangular faults, can be recovered if the number of faulty nodes is less than 10% of the total network nodes. Both non-adaptive and adaptive fault-tolerant routing algorithms are proposed to handle these resulted convex faults. The adaptive routing algorithm is enhanced from the non-adaptive counterpart by utilizing the virtual channels that are not used in the non-adaptive algorithm; hence, the number of virtual channels per physical channel used in the adaptive algorithm is the same to that used in the non-adaptive algorithm.
Other Subjects
Adaptive algorithms; Communication channels (information theory); Computer simulation; Congestion control (communication); Data communication systems; Fault tolerant computer systems; Telecommunication traffic; Virtual reality; Convex faults; Fault tolerant wormhole routing; Two-dimensional mesh networks; Computer networks
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
19.pdf
Size
166.09 KB
Format
Adobe PDF
Checksum
(MD5):e067b7591c18d8d6a36edeb8fd55a028