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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Consistent and efficient recovery for causal message logging'. Together they form a unique fingerprint.

Cite this