DocumentCode
2488303
Title
The distributed program reliability analysis on star topologies
Author
Chang, Ming-Sang ; Chen, Deng-Jyi ; Lin, Min-Sheng ; Ku, Kuo-Lung
Author_Institution
Inst. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear
1998
fDate
14-16 Dec 1998
Firstpage
100
Lastpage
106
Abstract
We show that computing distributed program reliability on the star distributed computing system is NP-hard. We develop a polynomially solvable case to compute 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 an approximate solution when the star topology is not satisfied with the additional file distribution
Keywords
computational complexity; distributed programming; programming theory; software reliability; NP-hard; distributed computing system; distributed program reliability analysis; file distribution; polynomial time algorithm; polynomially solvable case; star topologies; Computer network reliability; Computer science; Distributed control; Educational institutions; Information analysis; Information management; Physics computing; Polynomials; Reliability engineering; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems, 1998. Proceedings. 1998 International Conference on
Conference_Location
Tainan
ISSN
1521-9097
Print_ISBN
0-8186-8603-0
Type
conf
DOI
10.1109/ICPADS.1998.741025
Filename
741025
Link To Document