Reliability analysis of tree, torus and hypercube message passing architectures

As the number of processors in any parallel processing system increases, undoubtedly the complexity of the system both from hardware as well as software point of view would increase. This in turn would increase the probability of both transient and permanent failures and pose serious reliability problems. One solution is to build redundant communication paths and provide spare units and introduce dynamic reconfiguration capability into network design. The simulation methodology implemented in the paper provides reliability comparisons on three most important message passing architectures: tree, torus and hypercube configurations. The simulation results are supported and analysed through graphical presentations. In conclusion, the strengths and weaknesses of each model is highlighted. This in turn would assist the user in selecting the most reliable architecture of those discussed