Abstract
Besides performance and fault tolerance, area and power are the important issues in large scale fat-tree networks. In this work, we implement a router with local fault-tolerant multicast routing that guarantees connection and deadlock-free in k-ray n-tree up to k simultaneous faults. The it is routed by the label of the routers and processing nodes. We design a modi ed ID table to reduce the table size, and develop a method to remove the extra signal in priority arrangement for solving the problem of the multicast- rst routing mechanism. For fault tolerance, we design a modi ed path selection to decrease the interconnection in a router. To evaluate area and power of the proposed schemes, we use the verilog to im-plement the proposed scheme and related works. Compared to the modi ed fat tree(MFT)[8]and MLID, when fat tree size increase to 2-ary 6-tree, the area and power of our proposed scheme is smaller than MLID, and closed to the MFT. In 2-ary 7-tree, the area and power of our proposed method are smaller than that of the MFT and MLID. To reduce the extra latency, the proposed scheme adopts the one-hop vector to detect link and switch faults. When the one-hop vector is used, the performance increases up to 42%. Because of the local routing scheme, the growth of the area and power of the proposed scheme is very slow that means our proposed scheme is suitable for large scale fat tree router design.