An algorithm to generate FSTs for the reliability analysis of distributed systems

Author

Huang, T.H. ; Chen, D.J. ; Sheng, M.C.

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsin Chu, Taiwan

fYear

1990

fDate

24-27 Sep 1990

Firstpage

150

Abstract

The authors present a unified algorithm to efficiently generate file spanning trees (FSTs) and compute the distributed program reliability (DPR) and distributed system reliability (DSR). The algorithm is based on the concept of cutting one particular link in the distributed processing system (DPS) graph each time for generating different combination subgraphs. This approach guarantees no redundant FSTs to be generated during the subgraphs generating process. The reliability computation of the DPS is only needed to sum up the probability of the FSTs. A DPS reliability analysis tool based on the algorithm is implemented and is used to analyze several DPS examples for comparisons

Keywords

distributed processing; software reliability; trees (mathematics); distributed processing system; distributed program reliability; distributed system reliability; file spanning trees; graph; probability; reliability analysis tool; subgraphs generating process; Algorithm design and analysis; Computer network reliability; Computer science; Distributed computing; Distributed processing; Performance analysis; Reliability engineering; Resource management; Throughput; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Communication Systems, 1990. IEEE TENCON'90., 1990 IEEE Region 10 Conference on

Print_ISBN

0-87942-556-3

Type

conf

DOI

10.1109/TENCON.1990.152587

Filename

152587