This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Immucube: Scalable Fault-Tolerant Routing for k-ary n-cube Networks
June 2007 (vol. 18 no. 6)
pp. 776-788
Jos? ?ngel Gregorio, IEEE Computer Society

Abstract—This work presents Immucube, a scalable and efficient mechanism to improve dependability of interconnection networks for parallel and distributed computers. Immucube achieves better flexibility and scalability than any other previous fault-tolerant mechanism in k-ary n-cubes. The proposal inherits from Immunet several advantages over other previous fault-tolerant routing algorithms: 1) allowing any temporal and spatial fault combination, 2) permitting automatic and application-transparent reconfiguration after any fault, and 3) requiring a negligible overhead in the absence of faults. Immucube introduces new important features, such as: 4) providing graceful performance degradation, even in very large interconnection networks, 5) tolerating transparent resource utilization after transitory faults or partial repair of faulty resources, 6) being able to deal with intermittent faults, and 7) being able to dynamically recover the original network performance when all the failed components have been repaired.

Index Terms:
Interconnection networks, fault-tolerant routing, k{\hbox{-}}aryn{\hbox{-}}cubes.
Citation:
Valentin Puente, Jos? ?ngel Gregorio, "Immucube: Scalable Fault-Tolerant Routing for k-ary n-cube Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 6, pp. 776-788, June 2007, doi:10.1109/TPDS.2007.1047
Usage of this product signifies your acceptance of the Terms of Use.