Abstract
Checkpointing is a well-known procedure to reduce the execution time of programs in the presence of failures. If a failure occurs, the work done on the program since the last checkpoint is lost and therefore must be repeated in order to continue the correct execution of the program. A new model is developed for the analysis of the distribution of the program execution time. The questions of whether checkpointing is beneficial and the optimal checkpointing rate are addressed. A queueing analysis is performed to obtain the distribution of the response time of a program in a queueing environment.
Sign-in/Register to access full text options 
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.
