DocumentCode
3242182
Title
Self-stabilizing wormhole routing on ring networks
Author
Datta, Ajoy K. ; Gradinariu, Maria ; Kenitzki, Anthony B. ; Tixeuil, Sébastien
Author_Institution
Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA
fYear
2002
fDate
17-20 Dec. 2002
Firstpage
425
Lastpage
430
Abstract
Wormhole routing is the most common in parallel architecture in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing messages between parallel processors. Self-stabilization is a technique that guarantees tolerance to transient faults (e.g. memory corruption or communication hazard) for a given protocol. Self-stabilization guarantees that the network recovers to a correct behavior infinite time, without the need for human intervention. Self-stabilization also guarantees the safety property, meaning that once the network is in a legitimate state, it will remain there until another fault occurs. This paper presents the first self-stabilizing network algorithm in the wormhole routing model, using the unidirectional ring topology. Our solution benefits from wormhole routing by providing high throughput and low latency, and front self-stabilization by ensuring automatic resilience to all possible transient failures.
Keywords
data structures; fault tolerance; message passing; multiprocessor interconnection networks; network routing; network topology; parallel algorithms; data structures; distributed algorithms; fault-tolerance; message passing; parallel architectures; self-stabilization; unidirectional ring topology; wormhole routing; Delay; Hazards; Humans; Network topology; Parallel architectures; Protocols; Resilience; Routing; Safety; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems, 2002. Proceedings. Ninth International Conference on
ISSN
1521-9097
Print_ISBN
0-7695-1760-9
Type
conf
DOI
10.1109/ICPADS.2002.1183434
Filename
1183434
Link To Document