Using Common Knowledge to Improve Fixed-Dependency-After-Send
Resumo
Checkpoint patterns that enforce the rollbak-dependency trackability (RDT) property allow effcient solutions to the determination of consistent global checkpoints that include a given set of checkpoints. Fixed-Dependency-After-Send (FDAS) is a well-known RDT protocol that forces the dependency vector of a process to remain unchanged during a checkpoint interval after the first message-send event. In this paper, we explore processes' common knowledge about their behavior to derive a more effcient condition to induce checkpoints under FDAS. We consider that our approach can be used to improve other RDT checkpointing protocols.
Palavras-chave:
Distributed systems, Fault-tolerance, Distributed checkpointing, Rollback-dependency trackability
Referências
R. Baldoni, J. M. Helary, A. Mostefaoui, and M. Raynal. A communication-induced checkpoint protocol that ensures rollback dependency trackability. In JEEE Symposium on Fault Tolerant Computing (FTCS’97), pages 68-77, 1997.
M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. on Computing Systems, 3(1):63-75, Feb. 1985.
E. N. Elnozahy, D. Johnson, and Y.M.Yang. A survey of rollback-recovery protocols in message-passing systems. Technical Report CMU-CS-96-181, Carnegie Mellon University, 1996.
J. Gosling, B. Joy, and G. L. Steele. The Java Language Specification. Java Series. Addison-Wesley, Sept. 1996.
T. R. K. Venkatesh and H. F. Li. Optimal checkpointing and local recording for domino-free rollback recovery. Information Processing Letters, 25(5):295-303, 1987.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, July 1978.
D. Manivannan and M. Singhal. Quasi-synchronous checkpointing: Models, characterization, and classification. IEEE Trans. on Parallel and Distributed Systems, 10(7), July 1999.
Y. M. Wang. Consistent global checkpoints that contain a given set of local checkpoints. IEEE on Computers, 46(4):456-468, Apr. 1997.
M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. on Computing Systems, 3(1):63-75, Feb. 1985.
E. N. Elnozahy, D. Johnson, and Y.M.Yang. A survey of rollback-recovery protocols in message-passing systems. Technical Report CMU-CS-96-181, Carnegie Mellon University, 1996.
J. Gosling, B. Joy, and G. L. Steele. The Java Language Specification. Java Series. Addison-Wesley, Sept. 1996.
T. R. K. Venkatesh and H. F. Li. Optimal checkpointing and local recording for domino-free rollback recovery. Information Processing Letters, 25(5):295-303, 1987.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, July 1978.
D. Manivannan and M. Singhal. Quasi-synchronous checkpointing: Models, characterization, and classification. IEEE Trans. on Parallel and Distributed Systems, 10(7), July 1999.
Y. M. Wang. Consistent global checkpoints that contain a given set of local checkpoints. IEEE on Computers, 46(4):456-468, Apr. 1997.
Publicado
15/07/2000
Como Citar
GARCIA, Islene C.; BUZATO, Luiz E..
Using Common Knowledge to Improve Fixed-Dependency-After-Send. In: WORKSHOP DE TESTES E TOLERÂNCIA A FALHAS (WTF), 2. , 2000, Curitiba/PR.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2000
.
p. 16-21.
ISSN 2595-2684.
DOI: https://doi.org/10.5753/wtf.2000.23468.
