Browse by author
Lookup NU author(s): Dr Paul EzhilchelvanORCiD, Emeritus Professor Isi Mitrani
This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0).
© 2024 Copyright held by the owner/author(s).A server subject to random breakdowns and repairs offers services to incoming jobs whose lengths are highly variable. A checkpointing policy is in operation, aiming to protect against possibly lengthy recovery periods by backing up the current state at periodic checkpoints. The problem of how to choose a checkpointing interval to optimise performance is addressed by analysing a general queueing model which includes breakdowns, repairs, back-ups and recoveries. Exact solutions are obtained under both Markovian and non-Markovian assumptions. Numerical experiments illustrate the conditions where checkpoints are useful and where they are not, and, in the former case, quantify the achievable benefits.
Author(s): Ezhilchelvan P, Mitrani I
Publication type: Article
Publication status: Published
Journal: ACM Transactions on Modeling and Performance Evaluation of Computing Systems
Year: 2024
Volume: 9
Issue: 3
Print publication date: 21/05/2024
Online publication date: 13/04/2024
Acceptance date: 01/04/2024
Date deposited: 17/09/2024
ISSN (print): 2376-3639
ISSN (electronic): 2376-3647
Publisher: Association for Computing Machinery
URL: https://doi.org/10.1145/3613615
DOI: 10.1145/3658667
Altmetrics provided by Altmetric