Access Restriction

Author Huang, T.H. ♦ Chen, D.J. ♦ Sheng, M.C.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1990
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Algorithm design and analysis ♦ Computer network reliability ♦ Tree graphs ♦ Distributed computing ♦ Computer science ♦ Reliability engineering ♦ Distributed processing ♦ Performance analysis ♦ Resource management ♦ Throughput
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.
Description Author affiliation: Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsin Chu, Taiwan (Huang, T.H.; Chen, D.J.; Sheng, M.C.)
ISBN 0879425563
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1990-09-24
Publisher Place Hong Kong
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 466.73 kB
Page Count 5
Starting Page 150
Ending Page 154

Source: IEEE Xplore Digital Library