Checkpointing models for tasks with widely different processing times

Ezhilchelvan, P; Mitrani, I

doi:10.1007/978-3-031-25049-1_7

Checkpointing models for tasks with widely different processing times

Lookup NU author(s): Dr Paul Ezhilchelvan ORCiD, Emeritus Professor Isi Mitrani

Downloads

Accepted version [.pdf]

Licence

This is the authors' accepted manuscript of a conference proceedings (inc. abstract) that has been published in its final definitive form by Springer, 2023.

For re-use rights please refer to the publisher's terms and conditions.

Abstract

A server subject to random breakdowns and repairs offers services to incomingjobs whose lengths are highly variable. A checkpointing policy aiming to protectagainst possibly lengthy recovery periods is in operation. The problem of howto choose a checkpointing interval in order to optimize performance is addressedby analysing a general queueing model which includes breakdowns, repairs, back-upsand recoveries. Exact solutions are obtained under both Markovian andnon-Markovian assumptions. Numerical experiments illustrate the conditionswhere checkpoints are useful and where they are not, and in the former case,quantify the achievable benefits.