Adaptive and Deadlock-Free Routing for Irregular Faulty Patterns in Mesh Multicomputers
Resource
IEEE Transactions on Parallel and Distributed Systems 11 (1): 50-63
Journal
IEEE Transactions on Parallel and Distributed Systems
Journal Volume
11
Journal Issue
1
Pages
50-63
Date Issued
2000
Date
2000
Author(s)
Abstract
Message routing achieves the internode communication in parallel computers. A reliable routing is supposed to be deadlock-free and fault-tolerant. While many routing algorithms are able to tolerate a large number of faults enclosed by rectangular faulty blocks, there is no existing algorithm that is capable of handling irregular faulty patterns for wormhole networks. In this paper, a two-staged adaptive and deadlock-free routing algorithm called `Routing for Irregular Faulty Patterns' (RIFP) is proposed. It can tolerate irregular faulty patterns by transmitting messages from sources or to destinations within faulty blocks via multiple `intermediate nodes.' A method employed by RIFP is first introduced to generate intermediate nodes using the local failure information. By its aid, two communicating nodes can always exchange their data or intermediate results if there is at least one path between them. RIFP needs two virtual channels per physical link in meshes.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
24.pdf
Size
1.02 MB
Format
Adobe PDF
Checksum
(MD5):962e0f731d266adc044a2c456fd79211