Minimum mutable checkpoint-based coordinated checkpointing protocol for mobile distributed systems. (1st January 2014)

• Record Type: Journal Article
• Authors: Awasthi, Lalit K.; Misra, Manoj; Joshi, R.C.
• Is Part Of: International journal of communication networks and distributed systems. Volume 12:Number 4(2014)
• Page Start: 356
• Page End: 380
• Publication Date: 2014-01-01
• Subjects: mobile distributed system -- mutable checkpoint -- fault tolerance -- coordinated checkpointing -- domino-effect -- consistent global state; Computer networks -- Periodicals; Telecommunication systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; 004.6
• Languages: English
• ISSNs: 1754-3916

Abstract

Coordinated checkpointing is an attractive approach to add fault tolerance to mobile distributed systems transparently against various predictable and unexpected faults. This approach avoids domino effect and require minimum stable storage but may require additional synchronisation messages and blocking. Coordinated checkpointing overhead can be minimised either by minimising processes to checkpoint or by making checkpointing process non-blocking. In literature it has been reported that there cannot be a minimum process non-blocking coordinated checkpointing protocol. Minimisation of processes to checkpoint for an initiation can be combined with non-blocking by taking some additional checkpoints that may be discarded on completion of the checkpoint protocol (unnecessary checkpoints). Such checkpoints are called mutable if stored on local memory of mobile host temporarily. In this paper, we investigated this problem further and designed an efficient coordinated checkpointing protocol that is non-blocking, requires coordination of only minimum number of processes and reduces the overhead of unnecessary checkpoints significantly. Simulation studies show that our protocol reduces the number of unnecessary checkpoints almost to zero.