Abstract
In this paper, we will prove that the new consistency condition for checkpoints must be needed in systems based on PWD model and propose an efficient coordinated checkpointing scheme. In our scheme, whenever process constructs a consistent global checkpoint set, it must obey the new consistency condition instead of previous consistency condition. That is, an execution of process is divided into an unique state interval occurred by non-deterministic event and checkpoint is taken in only processes happened a state interval transition. Consequently, proposed coordinated checkpointing scheme removes an unnecessary overhead emerged in previous works and guarantees the limited rollback propagation on the occurrence of a failure in systems based on PWD model.
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
E. N. Elnozahy, D. B. Johnson and Y. M. Wang, “A Survey of Rollbalck-Recovery Protocols in Message Passing Systems,” CMU Technical Report CMU-CS-99-148, June. 1999.
E. N. Elnozahy and W. Zwaenepoel, “On the use and implementation of message logging,” In Proceedings of the 24-th International Symposium on Fault-Tolerant Computing, pp. 298–307, Jun. 1994.
R. E. Strom and S. Yemini, “Optimistic recovery in distributed systems,” ACM Trans. on Computer Systemss, vol. 3, No. 3, pp. 204226, Aug. 1985.
L. Alvisi, “Understanding the message logging paradigm ofr mssking process crashes,” Ph. D. Thesis, Department of Computer Science, Comell University, Jan. 1996.
L. Alvisi and K. Marzullo, “Message Logging: Pessimistic, Optimistic, Causal and Optimal,” IEEE Trans. on Software Engineering, vol. 24, pp. 149–159, Feb. 1998.
S. Rao, L. Alvisi and H. M. Vin, “The cost of recovery in message logging protocols,” In Proceedings of the 17-th IEE-E Symposium on Reliable Distributed Sys-tems(SRDS), pp. 10–18, 1998.
D. B. Johnson and W. Zwaenepoel, “Recovery in distributed systems using optimistic message logging and checkpointing,” Journal of Algorithms, vol. 11, pp. 462–491, Sept. 1990.
E. N. Elnozahy, D. B. Johnson and W. Zwaenepoel, “The Performance of Consistent Checkpointing,” Proc. 11th Symp. on Reliable Distributed Systems, pp. 39–47, Oct. 1992.
D. B. Johnson and W. Zwaenepoel, “Sender-based message logging,” In Proceedings of the 17th International Symposium on Fault=Tolerant Computing, pp. 14–19, June. 1987.
D. B. Johnson, ”Distributed system fault tolerance using message logging and checkpointing,” Ph. D. Thesis, Rice University, Dec. 1989.
K. M. Chandy and L. Lamport, “Distributed snapshots: Determining global states of distributed systems,” ACM Trans. on Computer Systems, vol. 3, No. 1, pp. 63–75, Feb. 1985.
R. Koo and S. Toueg, “Checkpointing and rollback-recovery for distributed systems,” IEEE Trans. on Software Engineering, vol. SE-13, No. 1, pp. 23–31, Jan. 1987.
G. Cao and M. Singhal, ”On Coordinated Checkpointing in Distributed Systems,” IEEE Trans. on Parallel and Distributed Systems, vol. 9, No. 12, pp. 1213–1225, Dec. 1998.
H. J. Michel, R. H. Netzer and M. Raynal, “Consistency Issues in Distributed Checkpoints,” IEEE Trans. on Software Engineering, vol. 25, No. 2, pp. 274–281, March/April. 1999.
Nitin H. Vaidya, “Staggered Consistent Checkpointing,” IEEE Trans. on Parallel and Distributed Systems, vol. 10, No. 7, pp. 694–702, July. 1999.
J. Fowler and W. Zwaenepoel, “Causal Distributed Breakpoints,” Proc. Int’l Conf. Distributed Computing Systems, pp. 134–141, May. 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baik, M., Shon, J., Kim, K., Ahn, J., Hwang, C. (2002). An Efficient Coordinated Checkpointing Scheme Based on PWD Model. In: Chong, I. (eds) Information Networking: Wireless Communications Technologies and Network Applications. ICOIN 2002. Lecture Notes in Computer Science, vol 2344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45801-8_73
Download citation
DOI: https://doi.org/10.1007/3-540-45801-8_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44255-4
Online ISBN: 978-3-540-45801-2
eBook Packages: Springer Book Archive