Distributed Application Checkpointing for Replicated State Machines

Main Article Content

Özdinç Çelikel
Tolga Ovatman


Application checkpointing is a widely used recovery mechanism that consists of saving an application's state periodically to be used in case of a failure. In this study we investigate the utilisation of distributed checkpointing for replicated state machines. Conventionally, for replicated state machines, checkpointing information is stored in a replicated way in each of the replicas or separately in a single instance. Applying distributed checkpointing provides a means to adjust the level of fault tolerance of the checkpointing approach by giving away from recovery time. We use a local cluster and cloud environment to examine the effects of distributed checkpointing in a simple state machine example and compare the results with conventional approaches. As expected, distributed checkpointing gains from memory consumption and utilise different levels of fault tolerance while performing worse in terms of recovery time.

Article Details

Research Papers
Author Biography

Tolga Ovatman, Department of Computer Engineering, Istanbul Technical University, Turkey

Tolga Ovatman received the B.Sc. degree in computer engineering from Hacettepe University, Turkey, in 1999, and the M.Sc. and Ph.D. degrees in computer engineering from Istanbul Technical University (ITU), Turkey, in 2005 and 2011, respectively. He is an Associate Professor with the Computer Engineering Department, ITU. His research interests include cloud computing, model checking, parallel programming, and object-oriented design.