This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Algorithms for Selection of Recovery Points in Tree Task Models
July 1991 (vol. 17 no. 7)
pp. 731-735

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.

[1] K. M. Chandy, "A survey of analytical models of roll back and recovery strategies,"IEEE Trans. Comput., vol. 8, pp. 40-47, May 1975.
[2] K. M. Chandy and C. V. Ramamoorthy, "Rollback and recovery strategies for computer programs,"IEEE Trans. Comput., vol. C-21, pp. 546-556, June 1972.
[3] S. K. Chen, W. T. Tsai, and M. B. Thuraisingham, "Recovery point selection on a reverse binary tree task model,"IEEE Trans. Software Eng., vol. SE-15, pp. 963-975, Aug. 1989.
[4] M. Gransky, I. Koren, and G. M. Silberman, "The effect of operation scheduling on the performance of a data flow computer,"IEEE Trans. Comput., vol. C-36, pp. 1019-1029, Sept. 1987.
[5] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[6] B. Indurkhya, H. S. Stone, and L. Xi-Cheng, "Optimal partitioning of randomly generated distributed programs,"IEEE Trans. Software Eng., vol. SE-12, pp. 483-495, Mar. 1986.
[7] S. K. Mishra, V. Raghavan, and N. Tzeng, "Efficient algorithms for selection of recovery points in tree task models," Center for Advanced Computer Studies, Univ. Southwestern Louisiana, Lafayette, LA, Tech. Rep. TR 90-5-6, 1990.

Index Terms:
tree task models; recovery points; task precedence; tree structure; uniprocessor environment; binary tree model; time complexity; exponential time requirements; arbitrary tree model; computational complexity; optimisation; trees (mathematics)
Citation:
S.K. Mishra, V.V. Raghavan, N.-F. Tzeng, "Efficient Algorithms for Selection of Recovery Points in Tree Task Models," IEEE Transactions on Software Engineering, vol. 17, no. 7, pp. 731-735, July 1991, doi:10.1109/32.83909
Usage of this product signifies your acceptance of the Terms of Use.