Checkpointing Models for Tasks of Different Types

作     者：Ezhilchelvan, Paul Mitrani, Isi 

作者机构：Newcastle Univ Sch Comp Newcastle Upon Tyne England 

出 版 物：《ACM TRANSACTIONS ON MODELING AND PERFORMANCE EVALUATION OF COMPUTING SYSTEMS》 (ACM Trans. Model. Perform. Eval. Comput. Syst.)

年 卷 期：2024年第9卷第3期

页      面：1-23页

核心收录：

基　　金：Science Committee  Ministry of Education and Science  Republic of Kazakhstan [AP09259208] 

主　　题：M/G/1 queue embedded Markov chains server vacations checkpoint optimisation 

摘      要：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.