1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, MSen_US
dc.contributor.authorChang, MSen_US
dc.contributor.authorChen, DJen_US
dc.contributor.authorKu, KLen_US
dc.date.accessioned2014-12-08T15:43:48Z-
dc.date.available2014-12-08T15:43:48Z-
dc.date.issued2001-06-01en_US
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0305-0548(99)00151-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/29604-
dc.description.abstractDistributed 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.isoen_USen_US
dc.subjectdistributed program reliabilityen_US
dc.subjectminimal file spanning treeen_US
dc.subjectalgorithmen_US
dc.subjectring of treeen_US
dc.titleThe distributed program reliability analysis on ring-type topologiesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0305-0548(99)00151-3en_US
dc.identifier.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.citation.volume28en_US
dc.citation.issue7en_US
dc.citation.spage625en_US
dc.citation.epage635en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:000168174200002-
dc.citation.woscount12-
Appears in Collections:Articles


Files in This Item:

  1. 000168174200002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...