Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Analysis and algorithms for restart

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
van Moorsel, A.P.A. ; Sch. of Comput. Sci., Newcastle Univ., NSW, Australia ; Wolter, K.

We analyse and optimise the completion time for a class of jobs whose conditional completion time is not always decreasing with the time invested in the job. For such jobs, restarts may speed up the completion. Examples of such jobs include download of Web pages, randomised algorithms, distributed queries and jobs subject to network or other failures. This paper derives computationally attractive expressions for the moments of the completion time of jobs under restarts and provides algorithms that optimise the restart policy. We also identify characteristics of optimal restart times as well as of probability distributions amenable to restarts.

Published in:

Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings. First International Conference on the

Date of Conference:

27-30 Sept. 2004