標題: A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems
作者: Chen, DJ
Chen, RS
Huang, TH
資訊科學與工程研究所
Institute of Computer Science and Engineering
關鍵字: Distributed Computing Systems (DCS);Distributed Program Reliability (DPR);Distributed System Reliability (DSR);reliability
公開日期: 1-十一月-1997
摘要: The 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.
URI: http://hdl.handle.net/11536/210
ISSN: 0898-1221
期刊: COMPUTERS & MATHEMATICS WITH APPLICATIONS
Volume: 34
Issue: 10
起始頁: 115
結束頁: 131
顯示於類別:期刊論文