標題: | The computational complexity of the reliability problem on distributed systems |
作者: | Lin, MS Chen, DJ 資訊科學與工程研究所 Institute of Computer Science and Engineering |
關鍵字: | distributed systems;distributed program reliability;computational complexity;graph theory |
公開日期: | 14-十一月-1997 |
摘要: | 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. |
URI: | http://dx.doi.org/10.1016/S0020-0190(97)00150-6 http://hdl.handle.net/11536/149699 |
ISSN: | 0020-0190 |
DOI: | 10.1016/S0020-0190(97)00150-6 |
期刊: | INFORMATION PROCESSING LETTERS |
Volume: | 64 |
起始頁: | 143 |
結束頁: | 147 |
顯示於類別: | 期刊論文 |