On the optimum checkpoint selection problem
SIAM Journal on Computing
Analysis of a Class of Recovery Procedures
IEEE Transactions on Computers
Optimal partitioning of randomly generated distributed programs
IEEE Transactions on Software Engineering
The effect of operation scheduling on the performance of a data flow computer
IEEE Transactions on Computers
On the Optimum Checkpoint Interval
Journal of the ACM (JACM)
Performance analysis of checkpointing strategies
ACM Transactions on Computer Systems (TOCS)
Optimization criteria for checkpoint placement
Communications of the ACM
Optimization criteria for checkpoint placement
Communications of the ACM
A first order approximation to the optimum checkpoint interval
Communications of the ACM
Efficient Algorithms for Selection of Recovery Points in Tree Task Models
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
An analysis is conducted of the complexity of placing recovery points where the computation is modeled as a reverse binary tree task model. The objective is to minimize the expected computation time of a program in the presence of faults. The method can be extended to an arbitrary reverse tree model. For uniprocessor systems, an optimal placement algorithm is proposed. For multiprocessor systems, a procedure for computing their performance is described. Since no closed form solution is available, an alternative measurement is proposed that has a closed form formula. On the basis of this formula, algorithms are devised for solving the recovery point placement problem. The estimated formula can be extended to include communication delays where the algorithm devised still applies.