The computational complexity of the reliability problem on distributed systems
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
147 | en_US |
dc.citation.spage |
143 | en_US |
dc.citation.volume |
64 | en_US |
dc.citation.woscount |
23 | en_US |
dc.contributor.author |
Lin, MS | en_US |
dc.contributor.author |
Chen, DJ | en_US |
dc.contributor.department |
資訊科學與工程研究所 | zh_TW |
dc.contributor.department |
Institute of Computer Science and Engineering | en_US |
dc.date.accessioned |
2019-04-02T05:58:44Z | |
dc.date.available |
2019-04-02T05:58:44Z | |
dc.date.issued |
1997-11-14 | en_US |
dc.description.abstract |
The reliability of a distributed program in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote data files will be executed successfully. This reliability varies according to (1) the topology of the distributed computing system, (2) the reliability of the communication links, (3) the data files and program distribution among processing elements, and (4) the data files required to execute a program. This paper shows that solving this reliability problem is NP-hard even when the distributed computing system is restricted to a series-parallel, a 2-tree, a tree, or a star structure. (C) 1997 Elsevier Science B.V. | en_US |
dc.identifier.doi |
10.1016/S0020-0190(97)00150-6 | en_US |
dc.identifier.issn |
0020-0190 | en_US |
dc.identifier.journal |
INFORMATION PROCESSING LETTERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0020-0190(97)00150-6 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/149699 | |
dc.identifier.wosnumber |
WOS:A1997YJ57400006 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
distributed systems | en_US |
dc.subject |
distributed program reliability | en_US |
dc.subject |
computational complexity | en_US |
dc.subject |
graph theory | en_US |
dc.title |
The computational complexity of the reliability problem on distributed systems | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Lin, M., & Chen, D. (1997). The computational complexity of the reliability problem on distributed systems. INFORMATION PROCESSING LETTERS, 64, 143–147. https://doi.org/10.1016/S0020-0190(97)00150-6
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/149699