Self-stabilizing checkpointing algorithm in ring topology

Authors:
Partha Sarathi Mandal;Krishnendu Mukhopadhyaya
Affiliations:
Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata, India;Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata, India
Venue:
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Year:
2005

Citing 9
Cited 0

Self-stabilization

ACM Computing Surveys (CSUR)
Distributed snapshots: determining global states of distributed systems

ACM Transactions on Computer Systems (TOCS)
Fault-containing self-stabilizing algorithms

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Staggered Consistent Checkpointing

IEEE Transactions on Parallel and Distributed Systems
Quasi-Synchronous Checkpointing: Models, Characterization, and Classification

IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Asynchronous recovery without using vector timestamps

Journal of Parallel and Distributed Computing
Scalable self-stabilization

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Concurrent checkpoint initiation and recovery algorithms on asynchronous ring networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

If the variables used for a checkpointing algorithm have data faults, the algorithm may fail. In this paper, a self-stabilizing checkpointing algorithm is proposed for handling data faults in a ring network. The proposed algorithm can deal with concurrent initiations of checkpointing and at most one data fault per process. However, several processes may be faulty.