Reduction of the total execution time to achieve the optimal k-node reliability of distributed computing systems using a novel heuristic algorithm
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
91 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
84 | en_US |
dc.citation.volume |
23 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Chiu, CC | en_US |
dc.contributor.author |
Yeh, YS | en_US |
dc.contributor.author |
Chen, RS | en_US |
dc.contributor.department |
資訊科學與工程研究所 | zh_TW |
dc.contributor.department |
Institute of Computer Science and Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:45:52Z | |
dc.date.available |
2014-12-08T15:45:52Z | |
dc.date.issued |
2000-01-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1016/S0140-3664(99)00158-9 | en_US |
dc.identifier.issn |
0140-3664 | en_US |
dc.identifier.journal |
COMPUTER COMMUNICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0140-3664(99)00158-9 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/30835 | |
dc.identifier.wosnumber |
WOS:000084605300009 | |
dc.language.iso |
en_US | en_US |
dc.subject |
distributed computing systems (DCS) | en_US |
dc.subject |
reliability optimization | en_US |
dc.subject |
k-node reliability (KNR) | en_US |
dc.title |
Reduction of the total execution time to achieve the optimal k-node reliability of distributed computing systems using a novel heuristic algorithm | en_US |
dc.type |
Article | en_US |
檔案
- 000084605300009.pdf (277.2 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chiu, C., Yeh, Y., & Chen, R. (2000). Reduction of the total execution time to achieve the optimal k-node reliability of distributed computing systems using a novel heuristic algorithm. COMPUTER COMMUNICATIONS, 23(1), 84–91. https://doi.org/10.1016/S0140-3664(99)00158-9
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30835