Permutation and Reliability Measures of Regular and Irregular Multistage Interconnection Networks

Abstract

The basic way to achieve high-performance, high-reliable computing is to use multiple processors linked by one or more shared buses. Such multiple bus systems offer the advantages of low hardware cost, high communication bandwidth, and graceful degradation in the presence of faults. The performance of multiprocessor system rests primarily on the design of the Interconnection Network (IN). Multistage Interconnection Networks (MINs) provides a compromise between the time shared and the crossbar networks. In this thesis, Irregular and Regular MIUNs are analyzed in terms of permutation passable, reliability and cost. Also a new MIN named Smart Four Tree (SFT) has been proposed in this work modifying the existing Four Tree (FT)MIN. The permutation passable determines the data routing capability, which dominates performance for large sizes. This parameter is analyzed in terms of identity and incremental permutation layouts and results shows that Irregular MINs have better permutations as compared to Regular MINs. The results of the Reliability evaluated in terms of Meantime to Failure (MTTF) shows that FT,FDOT have better reliability than ASEN, ABN MINs. It is also found that MTTF-Cost ratio is better for all Irregular MINs as compared to Regular MINs, thus showing the supremacy of Irregular over Regular networks. The results of the analysis SFT shows that it is better in terms of permutation passable than the existing Regular and Irregular MINs. Reliability of SFT is almost comparable to that of FT. Thus the proposed SFT provides an improvement over the performance of existing Irregular MINs.