Deng-Jyi Chen, Ming-Sang Chang, Ming-Cheng Sheng*
and Maw-Sheng Horng**
Institute of Computer Science and Information Engineering
National Chiao Tung University
Hsinchu, Taiwan 300, R.O.C.
* Department of Information Management
National Ping Tung Institute of Commerce
Ping Tung, Taiwan 912, R.O.C.
** Department of Mathematics and Science Education
National Taipei Teachers College
Taipei, Taiwan 106, R.O.C.
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.
Keywords: distributed program reliability, distribute system reliability, file spanning tree, file spanning forest, reliability
Retrieve PDF document (199812_10.pdf : 139,073 bytes)
Received October 3, 1996; accepted June 27, 1997.
Communicated by Shing-Tsaan Huang.
1 The early-version of this paper has been presented on the Fifth IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas.
This research was supported in part by the National Science Council and in part by the Chuan-San Institute of Science and Technology.