Fault-Tolerant Sequential Programming Using Recovery Blocks
暂无分享,去创建一个
When using recovery blocks [1], it is desirable to structure a program such that no unrecoverable operations (e.g. I/O) appear within a recovery block — thus ensuring that a recovery action will generate a consistent prior state. The figure below shows one case where only assignments are recoverable and a large file is to be processed (the merge sort example of the next section illustrates this approach):
Open image in new window
[1] S. K. Shrivastava,et al. Sequential pascal with recovery blocks , 1978, Softw. Pract. Exp..
[2] Brian Randell. System structure for software fault tolerance , 1975 .