Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Deadlock-free fault-tolerant routing in injured hypercubes
By: Shin, K.G.; Kim, J.;
1993 / IEEE
This item was taken from the IEEE Periodical ' Deadlock-free fault-tolerant routing in injured hypercubes ' Wormhole routing with the e-cube algorithm is an excellent solution for deadlock-free interprocess communication in healthy hypercubes. However, it does not work for injured hypercubes where some nodes and/or links are faulty. The authors propose a new deadlock-free routing scheme in an injured hypercube with the wormhole routing capability. All previously proposed schemes suggest the use of virtual channels to avoid the cycle of resource dependency. By contrast, the authors' scheme is based on the re-establishment of a routing path to the destination, but it does not always yield a shortest path between the source and destination. The proposed routing scheme uses either wormhole routing or staged routing, depending on the availability of one or more healthy (n-2)-cubes within an injured n-cube.<
Fault Tolerant Computing
Successful Message Delivery
Average Message Distance
Computing And Processing