Toggle Main Menu Toggle Search

Open Access padlockePrints

Analysis and algorithms for restart

Lookup NU author(s): Professor Aad van Moorsel


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


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. © 2004 IEEE.

Publication metadata

Author(s): Van Moorsel A, Woher K

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: First International Conference on the Quantitative Evaluation of Systems, (QEST)

Year of Conference: 2004

Pages: 195-204

Publisher: IEEE


DOI: 10.1109/QEST.2004.1348034

Library holdings: Search Newcastle University Library for this item

ISBN: 9780769521855