摘要
提出了几个保持可靠性不变的缩减,结合这些缩减,利用因子分解公式建立了一个计算具有不可靠结点的分布式计算网络分布程序可靠性的有效算法,算法的时间复杂性是O(N·(V+E)),并对一些网络在Pentium 120 计算机上作了计算,结果显示用本文算法计算DPR所产生的N和所用时间比其它算法的要小得多。
Present several reliability preserving reductions. By using these rules and factoring formula, an efficient algorithm was proposed to evaluate the distributed program reliability (DPR) of distributed computing networks with imperfect nodes. The time complexity of the algorithm is O(N·(V+E)), where N is the total number of the nodes in the generated tree, V and E are the node and link number of the network, respectively. The DPRs of different networks were evaluated by computer experiments on Pentium 120 PC. The number of leaves in generated tree and overall computing time are much less than that of other algorithm.
出处
《通信学报》
EI
CSCD
北大核心
2002年第9期22-28,共7页
Journal on Communications
基金
国家自然科学基金资助项目(19701006)
关键词
分布式计算网络
不可靠结点
分布程序可靠性
算法
因子分解公式
distributed computing network
imperfect node
distributed program reliability
algorithm
factoring formula
