Abstract
We present fault-tolerant message (packet) routing algorithms for hypercube that make use of the 2-neighborhood information. Our algorithms can tolerate (i) up to n faulty components in any Hamming ball of radius 3, and (ii) up to n-1 faulty components in the Hamming ball of radius 2 centered at the destination node. The path length of the packet is less than or equal to 3k, where k is the Hamming distance from the source to destination. We also show that Ω(k2) faults are required to make a packet to undertake a route of length 3k. Simulation study of the performance of the routing algorithms is presented. The structured buffer pool technique can be incorporated into our routing algorithms to prevent deadlock from occurring.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of TENCON'94 - 1994 IEEE Region 10's 9th Annual International Conference on: 'Frontiers of Computer Technology' |
| Publisher | IEEE |
| Pages | 440-444 |
| Volume | 1 |
| ISBN (Print) | 0-7803-1862-5 |
| DOIs | |
| Publication status | Published - Aug 1995 |
| Event | 1994 IEEE Region 10's 9th Annual International Conference (TENCON'94) - , Singapore Duration: 22 Aug 1994 → 26 Aug 1994 |
Conference
| Conference | 1994 IEEE Region 10's 9th Annual International Conference (TENCON'94) |
|---|---|
| Place | Singapore |
| Period | 22/08/94 → 26/08/94 |