Consistent and efficient recovery for causal message logging

Jin Ho Ahn, Sung-Gi Min, Chong Sun Hwang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

To reduce the number of stable storage accesses and impose no restriction on the execution of live processes during recovery, Elnozahy proposed a recovery algorithm based on causal message logging. However, the algorithm with independent checkpointing may force the system to be in an inconsistent state when processes fail concurrently. In this paper, we identify these inconsistent cases and then present a recovery algorithm to perform consistent recovery by allowing the recovery leader to collect recovery information from the other recovering processes as well as all live ones. Our recovery algorithm requires no additional message compared with Elnozahy’s algorithm.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages565-574
Number of pages10
Volume2344
ISBN (Print)3540442553, 9783540442554
Publication statusPublished - 2002
EventInternational Conference on Information Networking, ICOIN 2002 - Cheju Island, Korea, Republic of
Duration: 2002 Jan 302002 Feb 1

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2344
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Information Networking, ICOIN 2002
CountryKorea, Republic of
CityCheju Island
Period02/1/3002/2/1

Fingerprint

Recovery
Inconsistent
Checkpointing
Restriction

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ahn, J. H., Min, S-G., & Hwang, C. S. (2002). Consistent and efficient recovery for causal message logging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2344, pp. 565-574). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2344). Springer Verlag.

Consistent and efficient recovery for causal message logging. / Ahn, Jin Ho; Min, Sung-Gi; Hwang, Chong Sun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2344 Springer Verlag, 2002. p. 565-574 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2344).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ahn, JH, Min, S-G & Hwang, CS 2002, Consistent and efficient recovery for causal message logging. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2344, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2344, Springer Verlag, pp. 565-574, International Conference on Information Networking, ICOIN 2002, Cheju Island, Korea, Republic of, 02/1/30.
Ahn JH, Min S-G, Hwang CS. Consistent and efficient recovery for causal message logging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2344. Springer Verlag. 2002. p. 565-574. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ahn, Jin Ho ; Min, Sung-Gi ; Hwang, Chong Sun. / Consistent and efficient recovery for causal message logging. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2344 Springer Verlag, 2002. pp. 565-574 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5b12b097ecb24b8aaeb61822b01e2488,
title = "Consistent and efficient recovery for causal message logging",
abstract = "To reduce the number of stable storage accesses and impose no restriction on the execution of live processes during recovery, Elnozahy proposed a recovery algorithm based on causal message logging. However, the algorithm with independent checkpointing may force the system to be in an inconsistent state when processes fail concurrently. In this paper, we identify these inconsistent cases and then present a recovery algorithm to perform consistent recovery by allowing the recovery leader to collect recovery information from the other recovering processes as well as all live ones. Our recovery algorithm requires no additional message compared with Elnozahy’s algorithm.",
author = "Ahn, {Jin Ho} and Sung-Gi Min and Hwang, {Chong Sun}",
year = "2002",
language = "English",
isbn = "3540442553",
volume = "2344",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "565--574",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Consistent and efficient recovery for causal message logging

AU - Ahn, Jin Ho

AU - Min, Sung-Gi

AU - Hwang, Chong Sun

PY - 2002

Y1 - 2002

N2 - To reduce the number of stable storage accesses and impose no restriction on the execution of live processes during recovery, Elnozahy proposed a recovery algorithm based on causal message logging. However, the algorithm with independent checkpointing may force the system to be in an inconsistent state when processes fail concurrently. In this paper, we identify these inconsistent cases and then present a recovery algorithm to perform consistent recovery by allowing the recovery leader to collect recovery information from the other recovering processes as well as all live ones. Our recovery algorithm requires no additional message compared with Elnozahy’s algorithm.

AB - To reduce the number of stable storage accesses and impose no restriction on the execution of live processes during recovery, Elnozahy proposed a recovery algorithm based on causal message logging. However, the algorithm with independent checkpointing may force the system to be in an inconsistent state when processes fail concurrently. In this paper, we identify these inconsistent cases and then present a recovery algorithm to perform consistent recovery by allowing the recovery leader to collect recovery information from the other recovering processes as well as all live ones. Our recovery algorithm requires no additional message compared with Elnozahy’s algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84937510758&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937510758&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84937510758

SN - 3540442553

SN - 9783540442554

VL - 2344

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 565

EP - 574

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -