The distributed program reliability analysis on star topologies

Abstract

In this paper, we show that computing the distributed program reliability on the star distributed computing systems is NP-hard We develop a polynomially solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing distributed program reliability with approximate solution when the star topology is nor satisfied with the additional file distribution.