The Distributed Program Reliability Analysis on a Star Topology: Efficient Algorithms and Approximate Solution

Ming-Sang CHANG  Deng-Jyi CHEN  Min-Sheng LIN  Kuo-Lung KU  

IEICE TRANSACTIONS on Information and Systems   Vol.E82-D   No.6   pp.1020-1029
Publication Date: 1999/06/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Software Theory
distributed program reliability,  distributed computing system,  algorithm,  

Full Text: PDF>>
Buy this Article

A distributed computing system consists of processing elements, communication links, memory units, data files, and programs. These resources are interconnected via a communication network and controlled by a distributed operating system. The distributed program reliability (DPR) in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to retrieve data files from other processing elements will be executed successfully. This reliability varies according to 1) the topology of the distributed computing system, 2) the reliability of the communication edges, 3) the data files and programs distribution among processing elements, and 4) the data files required to execute a program. In this paper, we show that computing the distributed program reliability on a star distributed computing system is #P-complete. A polynomially solvable case is developed for computing the distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing the distributed program reliability with approximate solutions when the star topology has no the additional file distribution.