The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1991 vol.17)
pp: 731-735
ABSTRACT
<p>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.</p>
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
V.V. Raghavan, S.K. Mishra, "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
9 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool