Issue No. 01 - January (2000 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.824641
<p><b>Abstract</b>—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.</p>
Adaptive and deadlock-free routing, fault tolerance, wormhole switching, irregular faulty pattern, virtual channel, mesh multicomputer.
Sheng-De Wang, Ming-Jer Tsai, "Adaptive and Deadlock-Free Routing for Irregular Faulty Patterns in Mesh Multicomputers", IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 50-63, January 2000, doi:10.1109/71.824641