抄録
We have a job with N tasks each of which is
executed successively until it is completed. A double modular
system of error detection for the processing of each task is
adopted. Either type of checkpoints such as compare-checkpoint
or compare-and-store-checkpoint can be placed at the end of
tasks. Three schemes for the above process of a job are considered
and the mean execution times of each scheme are obtained.
Three schemes are compared and the best scheme is determined
numerically. Finally, as an example, a job with four tasks is given
and six types of schemes are compared numerically.
