Using message semantics to reduce rollback in optimistic message logging recovery schemes

Hong Va Leong, Divyakant Agrawal

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

18 Citations (Scopus)

Abstract

Recovery from failures can be achieved through asynchronous checkpointing and optimistic message logging. These schemes have low overheads during failure-free operations. Central to these protocols is the determination of a maximal consistent global state, which is recoverable. Message semantics is not exploited in most existing recovery protocols to determine the recoverable state. We propose to identify messages that are not influential in a computation through message semantics. These messages can be logically removed from the computation without changing its meaning or result. We show that considering these messages in the recoverable state computation gives rise to recoverable states that dominate the recoverable state defined under conventional model. We then develop an algorithm for identifying these messages. This technique can also be applied to ensure a more timely commitment for output in a distributed computation.
Original languageEnglish
Title of host publicationProceedings - International Conference on Distributed Computing Systems
PublisherIEEE
Pages227-234
Number of pages8
Publication statusPublished - 1 Dec 1994
Externally publishedYes
EventProceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems - Poznan, Poland
Duration: 21 Jun 199424 Jun 1994

Conference

ConferenceProceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems
CountryPoland
CityPoznan
Period21/06/9424/06/94

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this