Abstract
Communication-induced checkpointing algorithms require cooperating processes, which take checkpoints at their own pace, to take some forced checkpoints in order to guarantee domino-freeness. In this paper we present a checkpointing-recovery scheme which reduces the number of forced checkpoints, compared to previous solutions, while piggybacking, on each message, only three integers as control information. This is achieved by using information about the history of a process and an equivalence relation between local checkpoints that we introduce in this paper. A simulation study is also presented which quantifies such a reduction.
Partial funding provided by the Consiglio Nazionale delle Ricerche and by the Scientific Cooperation Network of the European Community OLOS (no. ERB4050PL932483).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Acharya and B.R. Badrinath. Checkpointing Distributed Application on Mobile Computers. In 3-th International Conference on Parallel and Distributed Information Systems Proc, pages 73–80, Austin, Texas, 1994.
R. Baldoni, J.M. Helary, A. Mostefaoui and M. Raynal. On Modeling Consistent Checkpoints and the Domino Effect in Distributed Systems. Technical Report No.2569, INRIA, France, 1995.
R. Baldoni, J.M. Helary, A. Mostefaoui and M. Raynal. A Communication-Induced Checkpointing Protocol that Ensures Rollback-Dependency Trackability. In IEEE Int. Symposium on Fault Tolerant Computing Proc., pages 68–77, 1997.
D. Briatico, A. Ciuffoletti and L. Simoncini. A Distributed Domino-Effect Free Recovery Algorithm. In 4-th IEEE symp. on Reliability Distr. Software and Database Proc, pages 207–215, 1984.
K.M. Chandy and L. Lamport. Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. on Computer Systems, 3(1):63–75, 1985.
E.N. Elnozahy, D.B. Johnson and Y.M. Wang. A Survey of Rollback-Recovery Protocols in Message-Passing Systems. Technical Report No. CMU-CS-96-181, School of Computer Science, Carnegie Mellon University, 1996.
R. Koo and S. Toueg. Checkpointing and Rollback-Recovery for Distributed Systems. IEEE Trans. on Software Engineering, 13(1):23–31, 1987.
L. Lamport. Time, Clocks and the Ordering of Events in a Distributed System. Comm. ACM, 21(7):558–565, 1978.
D. Manivannan and M. Singhal. A Low-overhead Recovery Technique Using Quasi-Synchronous Checkpointing, in Proc. IEEE INT. Conf. Distributed Comput. Syst., pages 100–107, 1996.
D. Manivannan and M. Singhal. Quasi-Synchronous Checkpointing: Models, Characterization, and Classification. Technical Report No.OSU-CISRC-5/96-TR33, Dept. of Computer and Information Science, The Ohio State University, 1996.
R.H.B. Netzer and J. Xu. Necessary and Sufficient Conditions for Consistent Global Snapshots. IEEE Trans. on Parallel and Distributed Systems, 6(2):165–169, 1995.
B. Randell. System Structure for Software Fault Tolerance. IEEE Trans. on Software Engineering, SE1(2):220–232, 1975.
R.D. Schlichting and F.B. Schneider. Fail-Stop Processors: an Approach to Designing Fault-Tolerant Computing Systems. ACM Trans. on Computer Systems, 1(3):222–238, 1983.
R.E. Strom and S. Yemini. Optimistic Recovery in Distributed Systems. ACM Trans. on Computer Systems, 3(2):204–226, 1985.
K. Venkatesh, T. Darhakrishnan and F. Li. Optimal Checkpointing and Local Encoding for Domino-Free Rollback Recovery. Information Processing Letters, 25:295–303, 1987.
Y.M. Wang. Consistent Global Checkpoints that Contains a Set of Local Checkpoints. IEEE Trans. on Computers, 46(4):456–468, 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Quaglia, F., Ciciani, B., Baldoni, R. (1998). A Checkpointing-Recovery Scheme for Domino-Free Distributed Systems. In: Fault-Tolerant Parallel and Distributed Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5449-3_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5449-3_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7488-6
Online ISBN: 978-1-4615-5449-3
eBook Packages: Springer Book Archive