The distributed program reliability analysis on ring-type topologies

doi:10.1016/S0305-0548(99)00151-3

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Lin, MS	en_US
dc.contributor.author	Chang, MS	en_US
dc.contributor.author	Chen, DJ	en_US
dc.contributor.author	Ku, KL	en_US
dc.date.accessioned	2014-12-08T15:43:48Z	-
dc.date.available	2014-12-08T15:43:48Z	-
dc.date.issued	2001-06-01	en_US
dc.identifier.issn	0305-0548	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0305-0548(99)00151-3	en_US
dc.identifier.uri	http://hdl.handle.net/11536/29604	-
dc.description.abstract	Distributed computing system (DCS) has become very popular for its high fault-tolerance, potential for parallel processing, and better reliability performance. One of the important issues in the design of the DCS is the reliability performance. Distributed program reliability (DPR) is addressed to obtain this reliability measure, In this paper, we propose a polynomial-time algorithm for computing the DPR of ring topology and show that solving the DPR problem on a ring of trees topology is NP-hard. (C) 2001 Elsevier Science Ltd. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	distributed program reliability	en_US
dc.subject	minimal file spanning tree	en_US
dc.subject	algorithm	en_US
dc.subject	ring of tree	en_US
dc.title	The distributed program reliability analysis on ring-type topologies	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0305-0548(99)00151-3	en_US
dc.identifier.journal	COMPUTERS & OPERATIONS RESEARCH	en_US
dc.citation.volume	28	en_US
dc.citation.issue	7	en_US
dc.citation.spage	625	en_US
dc.citation.epage	635	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.identifier.wosnumber	WOS:000168174200002	-
dc.citation.woscount	12	-
顯示於類別：	期刊論文

文件中的檔案：

000168174200002.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。