標題: Reduction of the total execution time to achieve the optimal k-node reliability of distributed computing systems using a novel heuristic algorithm
作者: Chiu, CC
Yeh, YS
Chen, RS
資訊科學與工程研究所
Institute of Computer Science and Engineering
關鍵字: distributed computing systems (DCS);reliability optimization;k-node reliability (KNR)
公開日期: 1-Jan-2000
摘要: A distributed computing system is a collection of processor-memory pairs connected by communication links. A k-node set is a subset of total nodes in a distributed computing system. A k-node set with capacity constraint is a k-node set that possesses sufficient node capacity. Because computing the reliability of a distributed computing system is generally an NP-hard problem, an adequate k-node set with a given capacity constraint must be determined by an effective algorithm with an approximate reliability. Relatively few investigations, namely an exact method and a k-tree reduction method, have examined k-node reliability optimization with capacity constraint. Such investigations either spent an exponential time or rarely obtained an optimal solution. Therefore, in this work, we present a novel heuristic algorithm to reduce the computational time and deviation from an exact solution. The proposed algorithm has simple independent steps, including selection of k-node sets according to a node's weight or a link's weight. The number of selected k-node sets is either one or two, thereby spending less time to compute the reliability of k-node sets. Computational results demonstrate that the proposed algorithm is more effective and provides a better solution for a large distributed computing system than those in previous investigations. (C) 2000 Elsevier Science B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/S0140-3664(99)00158-9
http://hdl.handle.net/11536/30835
ISSN: 0140-3664
DOI: 10.1016/S0140-3664(99)00158-9
期刊: COMPUTER COMMUNICATIONS
Volume: 23
Issue: 1
起始頁: 84
結束頁: 91
Appears in Collections:Articles


Files in This Item:

  1. 000084605300009.pdf