Consistent and efficient recovery for causal message logging

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

Consistent and efficient recovery for causal message logging

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Pages	565-574
Number of pages	10
Volume	2344
ISBN (Print)	3540442553, 9783540442554
Publication status	Published - 2002
Event	International Conference on Information Networking, ICOIN 2002 - Cheju Island, Korea, Republic of Duration: 2002 Jan 30 → 2002 Feb 1

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2344
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	International Conference on Information Networking, ICOIN 2002
Country/Territory	Korea, Republic of
City	Cheju Island
Period	02/1/30 → 02/2/1

ASJC Scopus subject areas

General Computer Science
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 proceeding › Conference 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 SG, 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{\textquoteright}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)",

note = "International Conference on Information Networking, ICOIN 2002 ; Conference date: 30-01-2002 Through 01-02-2002",

}

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

T2 - International Conference on Information Networking, ICOIN 2002

Y2 - 30 January 2002 through 1 February 2002

ER -

Consistent and efficient recovery for causal message logging

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this