Abstract
In this paper we study the complexity of placing recovery points in computer programs, so that the roll-back time is minimized. The roll-back time corresponds to the recomputation time involved from the previous correct point. Here we give O( n 2) time algorithms for placing recovery points when the underlying program model is either a path tree or a rooted tree. We also show that the problem is NP-complete when the underlying program model is a directed graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
