| C.C. Su and K.G. Shin, "Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes," IEEE Trans. Computers, 45(6): 666--683, June 1996. |
....similar task and system model, but consider other fault tolerance techniques in addition to Primary Backup. Additional work in fault tolerant scheduling can be found in [4, 13, 17] Adaptive fault tolerance has been studied in the context of routing in multiprocessor interconnects, for example in [22]. Lee and Shin introduced an active reconfiguration strategy for a degradable multi module computing system with a static set of tasks [12] They recognized that the system should reconfigure itself after a certain amount of mission time has passed, even without any failure. Their model is a ....
C. Su and K. Shin. Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes. IEEE Transactions on Computers, 45(6), June 1996.
....difficult and augment considerably the communication overhead. Most existing adaptive routing algorithms guarantee freedom from deadlock by defining a set of virtual networks implemented with virtual channels. Cycles can be prevented statically [7] 13] 2] or dynamically [8] Su and Shin [16] have proposed a solution for meshes and hypercubes that adopts only two virtual channels, but each node is assumed to know the state of its neighbors. All of these approaches require virtual channels to provide deadlock free routing in torus networks. Unfortunately, virtual channels can be ....
C.C. Su and K.G. Shin. Adaptive Fault-tolerant Deadlock-Free Routing in Meshes and Hypercubes. IEEE Transactions on Computers, 1995.
No context found.
C.C. Su and K.G. Shin, "Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes," IEEE Trans. Computers, 45(6): 666--683, June 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC