Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • Checkpointing for the RESTART problem in Markov networks

  • Part of
  • Lester Lipsky, Derek Doran, Swapna Gokhale
  • Journal:
    Journal of Applied Probability / Volume 48 / Issue A / August 2011
    Published online by Cambridge University Press:
    14 July 2016, pp. 195-207
    Print publication:
    August 2011
    • Article
      • You have access
    • PDF
    • Export citation

  • 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.

  • Optimal and adaptive stopping based on capture times

  • Norman Starr
  • Journal:
    Journal of Applied Probability / Volume 11 / Issue 2 / June 1974
    Published online by Cambridge University Press:
    14 July 2016, pp. 294-301
    Print publication:
    June 1974

  • Independent exponential capture times are assumed for each of N prey. The payoff is the number of prey caught less a linear time cost. The optimal stopping time and value are obtained. When N is known an adaptive statistical procedure is proposed for which the expected payoff differs from the value by at most one-half plus a term which tends to zero (of order N–α, a < 1) as N → ∞.