Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, DJen_US
dc.contributor.authorChen, RSen_US
dc.contributor.authorHuang, THen_US
dc.date.accessioned2014-12-08T15:01:20Z-
dc.date.available2014-12-08T15:01:20Z-
dc.date.issued1997-11-01en_US
dc.identifier.issn0898-1221en_US
dc.identifier.urihttp://hdl.handle.net/11536/210-
dc.description.abstractThe reliability of Distributed Computing Systems (DCS) in terms of Distributed Program Reliability (DPR) and Distributed System Reliability (DSR) has been studied intensively. Current reliability algorithms available for the analysis of DPR and DSR include MFST, FARE, FST, and FST-SPR. This paper presents a reliability algorithm, called HRFST, that eliminates the need to search a spanning tree during each subgraph generation. The HRFST algorithm reduces both the number of subgraphs (or trees) generated and the actual execution time required for analysis of DPR and DSR. Examination of several sample cases shows that the HRFST algorithm is more efficient than the FST-SPR algorithm.en_US
dc.language.isoen_USen_US
dc.subjectDistributed Computing Systems (DCS)en_US
dc.subjectDistributed Program Reliability (DPR)en_US
dc.subjectDistributed System Reliability (DSR)en_US
dc.subjectreliabilityen_US
dc.titleA heuristic approach to generating file spanning trees for reliability analysis of distributed computing systemsen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & MATHEMATICS WITH APPLICATIONSen_US
dc.citation.volume34en_US
dc.citation.issue10en_US
dc.citation.spage115en_US
dc.citation.epage131en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
Appears in Collections:Articles


Files in This Item:

  1. A1997YJ56800009.pdf