Fault-Tlerant Tree-Based Multicasting in Mesh Multicomputers

We propose a fault-tolerant tree-based multicast algorithm for2-dimensional (2-D) meshes based on the concept of the extended safetylevel which is a vector associated with each node to capture faultinformation in the neighborhood. In this approach each destination isreached through a minimum number of hops. In order to minimize thetotal number of traffic steps, three heuristic strategies are proposed.This approach can be easily implemented by pipelined circuit switching(PCS). A simulation study is conducted to measure the total number oftraffic steps under different strategies. Our approach is the firstattempt to address the fault-tolerant tree-based multicast problem in2-D meshes based on limited global information with a simple model andsuccinct information.