Sliding Substitution of Failed Nodes
Atsushi Hori, Kazumi Yoshinaga, Thomas Hérault, Aurélien Bouteiller, George Bosilca, Yutaka Ishikawa · 2015
This paper considers the questions of how spare nodes should be allocated, how to substitute them for faulty nodes, and how much the communication performance is affected by such a substitution. The third question stems from the modification of the rank mapping by node substitutions, which can incur additional message collisions. In a stencil computation, rank mapping is done in a straightforward way on a Cartesian network without incurring any message collisions. However, once a substitution has occurred, the node- rank mapping may be destroyed. Therefore, these questions must be answered in a way that minimizes the degradation of communication performance.