Multistage Interconnection Network Reliability
IEEE Transactions on Computers
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Reliability of a Class of Multistage Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Reliability Bounds for Large Multistage Interconnection Networks
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Performance of Processor-Memory Interconnections for Multiprocessors
IEEE Transactions on Computers
Fault tolerant irregular augmented shuffle network
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Petri nets extension to model state-varying failure rates
Proceedings of the 2013 Summer Computer Simulation Conference
| Hi-index | 0.00 |
In this paper reliability and path length analysis of irregular Multistage Interconnection Networks have been presented. We have examined FT(Four Tree)[8],MFT(Modified Four Tree)[2],NFT(New Four Tree)[4],IFT(improved Four Tree)[5],IASN(Irregular Augmented Shuffle)[14] and IIASN(Improved Irregular Augmented Shuffle)[3] networks in which the number of switches in each stage are different in numbers and also have express links[11]. Using upper and lower bounds[7][13][15] for larger networks, the reliability[9] in terms of mean time to failure of all these networks are evaluated and compared with each other. Each source is connected to destination with one or multiple paths with varying path lengths in a network. The path length analysis of all these networks is also analyzed in this paper. A path length[8] algorithm for IIASN network is also propose