The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1994 vol.43)
pp: 87-97
ABSTRACT
<p>Presents an algorithm for computing the reliability of distributed computing systems (DCS). The algorithm, called the Fast Reliability Evaluation Algorithm, is based on the factoring theorem employing several reliability preserving reduction techniques. The effect of file distributions, program distributions, and various topologies on reliability of the DCS is studied in detail using the proposed algorithm. Compared with existing algorithms on various network topologies, file distributions, and program distributions, the proposed algorithm is much more economical in both time and space. To compute the distributed program reliability, the ARPA network is studied to illustrate the feasibility of the proposed algorithm.</p>
INDEX TERMS
distributed processing; fault tolerant computing; programming theory; distributed computing systems; systems reliability analysis; program execution constraints; Fast Reliability Evaluation Algorithm; factoring theorem; file distributions; program distributions; network topologies; distributed program; graph theory; spanning tree; reliability-preserving reduction.
CITATION
Deng-Jyi Chen, "On Distributed Computing Systems Reliability Analysis Under Program Execution Constraints", IEEE Transactions on Computers, vol.43, no. 1, pp. 87-97, January 1994, doi:10.1109/12.250612
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool