Efficient Algorithms for Selection of Recovery Points in Tree Task Models

Authors:
Subhada K. Mishra;Vijay V. Raghavan;Nian-Feng Tzeng
Affiliations:
Univ. of Southwestern Louisiana, Lafayette;Univ. of Southwestern Louisiana, Lafayette;Univ. of Southwestern Louisiana, Lafayette
Venue:
IEEE Transactions on Software Engineering
Year:
1991

Citing 4
Cited 0

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
Recovery Point Selection on a Reverse Binary Tree Task Model

IEEE Transactions on Software Engineering
Fundamentals of Computer Alori

Fundamentals of Computer Alori

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient solutions to the problem of optimally selecting recovery points are developed. The solutions are intended for models of computation in which task precedence has a tree structure and a task may fail due to the presence of faults. An algorithm to minimize the expected computation time of the task system under a uniprocessor environment has been developed for the binary tree model. The algorithm has time complexity of O(N/sub 2/), where N is the number of tasks, while previously reported procedures have exponential time requirements. The results are generalized for an arbitrary tree model.