The Distributed Program Reliability Analysis on a Star Topology: Efficient Algorithms and Approximate Solution
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.6 pp.1020-1029
- Publication Date
- 1999/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Software Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ming-Sang CHANG, Deng-Jyi CHEN, Min-Sheng LIN, Kuo-Lung KU, "The Distributed Program Reliability Analysis on a Star Topology: Efficient Algorithms and Approximate Solution" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 6, pp. 1020-1029, June 1999, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_6_1020/_p
Copy
@ARTICLE{e82-d_6_1020,
author={Ming-Sang CHANG, Deng-Jyi CHEN, Min-Sheng LIN, Kuo-Lung KU, },
journal={IEICE TRANSACTIONS on Information},
title={The Distributed Program Reliability Analysis on a Star Topology: Efficient Algorithms and Approximate Solution},
year={1999},
volume={E82-D},
number={6},
pages={1020-1029},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - The Distributed Program Reliability Analysis on a Star Topology: Efficient Algorithms and Approximate Solution
T2 - IEICE TRANSACTIONS on Information
SP - 1020
EP - 1029
AU - Ming-Sang CHANG
AU - Deng-Jyi CHEN
AU - Min-Sheng LIN
AU - Kuo-Lung KU
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1999
AB - 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.
ER -
English
