Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T03:41:27.770Z Has data issue: false hasContentIssue false

Checkpointing for the RESTART problem in Markov networks

Published online by Cambridge University Press:  14 July 2016

Lester Lipsky
Affiliation:
University of Connecticut, Department of Computer Science and Engineering, University of Connecticut, 371 Fairfield Road, Storrs, CT 06269-2155, USA. Email address: lester@engr.uconn.edu
Derek Doran
Affiliation:
University of Connecticut, Department of Computer Science and Engineering, University of Connecticut, 371 Fairfield Road, Storrs, CT 06269-2155, USA. Email address: lester@engr.uconn.edu
Swapna Gokhale
Affiliation:
University of Connecticut, Department of Computer Science and Engineering, University of Connecticut, 371 Fairfield Road, Storrs, CT 06269-2155, USA. Email address: lester@engr.uconn.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We apply the known formulae of the RESTART problem to Markov models of software (and many other) systems, and derive new equations. We show how checkpoints might be included, with their resultant performance under RESTART. The result is a complete procedure for finding the mean, variance, and tail behavior of the job completion time as a function of the failure rate. We also provide a detailed example.

Information

Type
Part 4. Simulation
Copyright
Copyright © Applied Probability Trust 2011