Issue No. 04 - April (2011 vol. 60)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.97
Frank Olaf Sem-Jacobsen , Simula Research Laboratory , Lysaker
Olav Lysne , Simula Research Laboratory, Lysaker
José Duato , Simula Research Laboratory, Lysaker
Tor Skeie , Simula Research Laboratory, Lysaker
Fat trees are a very common communication architecture in current large-scale parallel computers. The probability of failure in these systems increases with the number of components. We present a routing method for deterministically and adaptively routed fat trees, applicable to both distributed and source routing, that is able to handle several concurrent faults and that transparently returns to the original routing strategy once the faulty components have recovered. The method is local and dynamic, completely masking the fault from the rest of the system. It only requires a small extra functionality in the switches to handle rerouting packets around a fault. The method guarantees connectedness and deadlock and livelock freedom for up to k -1 benign simultaneous switch and/or link faults where k is half the number of ports in the switches. Our simulation experiments show a graceful degradation of performance as more faults occur. Furthermore, we demonstrate that for most fault combinations, our method will even be able to handle significantly more faults beyond the k -1 limit with high probability.
Fat trees, k-ary n-trees, dynamic fault tolerance, deterministic routing, adaptive routing.
Frank Olaf Sem-Jacobsen, Olav Lysne, José Duato, Tor Skeie, "Dynamic Fault Tolerance in Fat Trees", IEEE Transactions on Computers, vol. 60, no. , pp. 508-525, April 2011, doi:10.1109/TC.2010.97