The distributed program reliability analysis on star topologies

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Chang, MS	en_US
dc.contributor.author	Chen, DJ	en_US
dc.contributor.author	Lin, MS	en_US
dc.contributor.author	Ku, KL	en_US
dc.date.accessioned	2014-12-08T15:27:20Z	-
dc.date.available	2014-12-08T15:27:20Z	-
dc.date.issued	1998	en_US
dc.identifier.isbn	0-8186-8603-0	en_US
dc.identifier.uri	http://hdl.handle.net/11536/19589	-
dc.description.abstract	In this paper, we show that computing the distributed program reliability on the star distributed computing systems is NP-hard We develop a polynomially solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing distributed program reliability with approximate solution when the star topology is nor satisfied with the additional file distribution.	en_US
dc.language.iso	en_US	en_US
dc.title	The distributed program reliability analysis on star topologies	en_US
dc.type	Proceedings Paper	en_US
dc.identifier.journal	1998 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS	en_US
dc.citation.spage	100	en_US
dc.citation.epage	106	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.identifier.wosnumber	WOS:000078318400013	-
顯示於類別：	會議論文