ON DISTRIBUTED COMPUTING SYSTEMS RELIABILITY-ANALYSIS UNDER PROGRAM EXECUTION CONSTRAINTS

被引:6
作者
CHEN, DJ
LIN, MS
机构
[1] Institute of Computer Science and Information Engineering, National Chiao-Tung University, Hsin Chu
关键词
DISTRIBUTED PROGRAM; DISTRIBUTED SYSTEM; FACTORING THEOREM; GRAPH THEORY; RELIABILITY; RELIABILITY-PRESERVING REDUCTION; SPANNING TREE;
D O I
10.1109/12.250612
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This correspondence 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.
引用
收藏
页码:87 / 97
页数:11
相关论文
共 21 条
[1]  
A KUMAR, 1988, P IEEE INFOCOM 88, P851
[2]  
AGGRAWAL KK, 1981, IEEE T RELIAB, V30, P32
[3]  
AGRAWAL DP, ADV COMPUTER ARCHITE
[4]  
BALL MO, OPT RES, V27, P132
[5]  
CHANG MKK, 1981, THESIS U CALIFORNIA
[6]  
CHEN DJ, 1991, CSI1991005 NAT CHIAO
[7]  
CHOU TCK, 1983, IEEE T COMPUT, V32, P799, DOI 10.1109/TC.1983.1676329
[8]  
DAVIES DW, 1981, LECTURE NOTES COMPUT, V105
[9]  
ENSLOW P, 1978, IEEE COMPUTER, V11
[10]  
GARCIAMOLINA J, 1982, IEEE COMPUT, V16, P34