Routing and path length algorithm for a cost-effective four-tree multistage interconnection network

Abstract

The characteristics of a new class of irregular fault-tolerant multi-stage interconnection network (MIN) called the four-tree (FT) network are analysed. A FT network can provide ‘full access’ capability even in the presence of multiple faults and is also cost-effective in comparison to other fault tolerant MINs. Rerouting in the presence of faults can be accomplished dynamically without resorting to backtracking. Further, for a non-uniform reference model, the network gives a larger throughput than any regular type of MIN due to smaller path lengths between a processor and its favourite memory modules. Algorithms for computing the path lengths and routing tags are developed for the proposed networks.