| Article ID: | iaor20013863 |
| Country: | United Kingdom |
| Volume: | 28 |
| Issue: | 7 |
| Start Page Number: | 625 |
| End Page Number: | 635 |
| Publication Date: | Jun 2001 |
| Journal: | Computers and Operations Research |
| Authors: | Chen Deng-Jyi, Chang Ming-Sang, Lin Min-Sheng, Ku Kuo-Lung |
| Keywords: | computers, computational analysis |
Distributed computing system (DCS) has become very popular for its high fault-tolerance, potential for parallel processing, and better reliability performance. One of the important issues in the design of the DCS is the reliability performance. Distributed program reliability (DPR) is addressed to obtain this reliability measure. In this paper, we propose a polynomial-time algorithm for computing the DPR of ring topology and show that solving the DPR problem on a ring of trees topology is NP-hard.