Aperiodic Checkpoint Placement Algorithms—Survey and Comparison
Aperiodic Checkpoint Placement Algorithms—Survey and Comparison作者机构：Department of Information Engineering Hiroshima University Hiroshima Japan
出 版 物：《Journal of Software Engineering and Applications》 (软件工程与应用（英文）)
年 卷 期：2013年第6卷第4期
页 面：41-53页
学科分类：1002[医学-临床医学] 100214[医学-肿瘤学] 10[医学]
主 题：Checkpoint Placement Aperiodic Policy Availability Models Computation Algorithms Comparison
摘 要：In this article we summarize some aperiodic checkpoint placement algorithms for a software system over infinite and finite operation time horizons, and compare them in terms of computational accuracy. The underlying problem is formulated as the maximization of steady-state system availability and is to determine the optimal aperiodic checkpoint sequence. We present two exact computation algorithms in both forward and backward manners and two approximate ones;constant hazard approximation and fluid approximation, toward this end. In numerical examples with Weibull system failure time distribution, it is shown that the combined algorithm with the fluid approximation can calculate effectively the exact solutions on the optimal aperiodic checkpoint sequence.
维普期刊数据库