The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
분산 컴퓨팅 시스템은 처리 요소, 통신 링크, 메모리 장치, 데이터 파일 및 프로그램으로 구성됩니다. 이러한 리소스는 통신 네트워크를 통해 상호 연결되고 분산 운영 체제에 의해 제어됩니다. 분산 컴퓨팅 시스템의 분산 프로그램 신뢰성(DPR)은 여러 처리 요소에서 실행되고 다른 처리 요소에서 데이터 파일을 검색해야 하는 프로그램이 성공적으로 실행될 확률입니다. 이 신뢰성은 1) 분산 컴퓨팅 시스템의 토폴로지, 2) 통신 에지의 신뢰성, 3) 처리 요소 간의 데이터 파일 및 프로그램 배포, 4) 프로그램을 실행하는 데 필요한 데이터 파일에 따라 달라집니다. 본 논문에서는 스타 분산 컴퓨팅 시스템에서 분산 프로그램 신뢰도를 계산하는 것이 #P-complete임을 보여줍니다. 스타 토폴로지에서 일부 추가 파일 배포가 제한되는 경우 분산 프로그램 신뢰도를 계산하기 위해 다항식으로 해결 가능한 사례가 개발되었습니다. 또한 스타 토폴로지에 추가 파일 배포가 없을 때 근사해를 사용하여 분산 프로그램 신뢰도를 계산하기 위한 다항식 시간 알고리즘을 제안합니다.
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.
부
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
부
@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},}
부
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 -