Research On Reliability Of Arrangement Graph In Parallel System

The arrangement graph An,k is an interconnected network with good properties in parallel systems.Reliability is an indicator to measure the health of the system,and the calculation of reliability is very important.This paper gives an approximate estimate of s-reliability by the bounds of s-reliability.Considering the robustness of the bounds,the Monte Carlo approximation algorithm of the arrangement graph is further designed.For the arrangement graphs with the same number of processors but different topological structures,the bounds of s-reliability is used to find that"the larger n is,the higher the s-reliability of the arrangement graph An,k is."The simulation results also verify this conclusion.Under the diameter limitation,d-reliability is proposed.The bound and robustness of d-reliability and the approximation algorithm are studied,and the simulation results are carried out.The simulation results achieve the expected results.