| Summary: | 博士 === 國立交通大學 === 資訊工程系 === 87 === 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 is addressed to obtain this reliability measure. The Distributed Program Reliability of a distributed computing system depends on the reliability of its communication links and nodes, as well as on the distribution of its resources, such as programs and data files.
In this thesis, we study distributed program reliability (DPR) on ring and star distributed computing systems. In the ring structure, We will discuss the distributed program reliability of ring network and ring of tree topology. We have proposed algorithms for computing DPR in ring network. We have also shown that computing the distributed program reliability of ring of tree topology is NP-hard. In star topologies, We have shown that computing the distributed program reliability of star topology in general is NP-hard. Two polynomially solvable cases are developed for computing 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 not satisfied with the additional file distribution.
|
|---|
