Issue No. 08 - August (1989 vol. 15)

ISSN: 0098-5589

pp: 963-976

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.31353

ABSTRACT

<p>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.</p>

INDEX TERMS

performance computation procedure; computation time minimization; recovery point selection; reverse binary tree task model; arbitrary reverse tree model; uniprocessor systems; optimal placement algorithm; multiprocessor systems; closed form solution; closed form formula; recovery point placement problem; communication delays; computational complexity; fault tolerant computing; multiprocessing systems; trees (mathematics)

CITATION

W.T. Tsai, S.-K. Chen, M.B. Thuraisingham, "Recovery Point Selection on a Reverse Binary Tree Task Model",

*IEEE Transactions on Software Engineering*, vol. 15, no. , pp. 963-976, August 1989, doi:10.1109/32.31353