A distributed routing scheme is presented for fault-tolerant communication in a multistage interconnection network. When faults occur, the scheme bypasses faulty switching elements by routing the message to an intermediate processor and then making the second pass to reach the final destination. It
Heuristic fault-tolerant routing strategies for a multiprocessor network
โ Scribed by Peter K.K. Loh
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 588 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0141-9331
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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
System reliability is an important aspect of real-time systems, because the result of a real-time application may be valid only if the application functions correctly and its timing constraints are satisfied. There are two kinds of faults, hardware and software faults, and the paper considers hardwa