完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Chang, Ming-Sang | |
| dc.contributor.author | Lin, Min-Sheng | |
| dc.contributor.author | Chen, Deng-Jyi | |
| dc.date.accessioned | 2009-08-23T04:46:30Z | |
| dc.date.accessioned | 2020-05-29T06:19:03Z | - |
| dc.date.available | 2009-08-23T04:46:30Z | |
| dc.date.available | 2020-05-29T06:19:03Z | - |
| dc.date.issued | 2006-10-24T01:38:03Z | |
| dc.date.submitted | 2001-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/2364 | - |
| 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 topologies and show that solving the DPR problem on a ring of trees topology is NP-hard. | |
| dc.description.sponsorship | 中國文化大學,台北市 | |
| dc.format.extent | 7p. | |
| dc.format.extent | 59448 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2001 NCS會議 | |
| dc.subject | Distributed Program Reliability | |
| dc.subject | Minimal File Spanning Tree | |
| dc.subject | Algorithm | |
| dc.subject | Ring of Tree | |
| dc.subject.other | Mobile and Distrubuted Applications | |
| dc.title | The Distributed Program Reliability Analysis on Ring-Type Topologies | |
| dc.title.alternative | 環狀拓樸邏輯分散式程式可靠度分析 | |
| 分類: | 2001年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs0020010000146.pdf | 58.05 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。