完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chen, DJ | en_US |
dc.contributor.author | Chang, MS | en_US |
dc.contributor.author | Sheng, MC | en_US |
dc.contributor.author | Horng, MS | en_US |
dc.date.accessioned | 2014-12-08T15:47:17Z | - |
dc.date.available | 2014-12-08T15:47:17Z | - |
dc.date.issued | 1998-12-01 | en_US |
dc.identifier.issn | 1016-2364 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/31727 | - |
dc.description.abstract | In this paper, we propose an approach to the reliability analysis of distributed programs that addresses real-time constraints. Our approach is based on a model for evaluating transmission time, which allows us to find the time needed to complete execution of the program, task, or mission under evaluation. With information on time-constraints, the corresponding Markov state space can then be defined for reliability computation. To speed up the evaluation process and reduce the size of the Markov state space, several dynamic reliability-preserving reductions are developed. A simple distributed real-time system is used as an example to illustrate the feasibility and uniqueness of the proposed approach. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | distributed program reliability | en_US |
dc.subject | distribute system reliability | en_US |
dc.subject | file spanning tree | en_US |
dc.subject | file spanning forest | en_US |
dc.subject | reliability | en_US |
dc.title | Time-constrained distributed program reliability analysis | en_US |
dc.type | Article | en_US |
dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.citation.volume | 14 | en_US |
dc.citation.issue | 4 | en_US |
dc.citation.spage | 891 | en_US |
dc.citation.epage | 911 | en_US |
dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
dc.contributor.department | Institute of Computer Science and Engineering | en_US |
dc.identifier.wosnumber | WOS:000077995800011 | - |
dc.citation.woscount | 1 | - |
顯示於類別: | 期刊論文 |