Aperiodic Checkpoint Placement Algorithms—Survey and ComparisonReportar como inadecuado

Aperiodic Checkpoint Placement Algorithms—Survey and Comparison - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

In this article we summarize someaperiodic checkpoint placement algorithms for a software system over infiniteand finite operation time horizons, and compare them in terms of computationalaccuracy. The underlying problem is formulated as the maximization ofsteady-state system availability and is to determine the optimal aperiodiccheckpoint sequence. We present two exact computation algorithms in bothforward and backward manners and two approximate ones; constant hazardapproximation and fluid approximation, toward this end. In numerical exampleswith Weibull system failure time distribution, it is shown that the combinedalgorithm with the fluid approximation can calculate effectively the exactsolutions on the optimal aperiodic checkpoint sequence.


Checkpoint Placement; Aperiodic Policy; Availability Models; Computation Algorithms; Comparison

Cite this paper

S. Hiroyama, T. Dohi and H. Okamura -Aperiodic Checkpoint Placement Algorithms—Survey and Comparison,- Journal of Software Engineering and Applications, Vol. 6 No. 4A, 2013, pp. 41-53. doi: 10.4236-jsea.2013.64A006.

Autor: Shunsuke Hiroyama, Tadashi Dohi, Hiroyuki Okamura

Fuente: http://www.scirp.org/


Documentos relacionados