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

Hong Va Leong, Divyakant Agrawal

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

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
Place of PublicationPiscataway, NJ, United States
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, Pol
Duration: 21 Jun 199424 Jun 1994

Other

OtherProceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems
CityPoznan, Pol
Period21/6/9424/6/94

Fingerprint

Semantics
Recovery

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Leong, H. V., & Agrawal, D. (1994). Using message semantics to reduce rollback in optimistic message logging recovery schemes. In Proceedings - International Conference on Distributed Computing Systems (pp. 227-234). Piscataway, NJ, United States: IEEE.

Using message semantics to reduce rollback in optimistic message logging recovery schemes. / Leong, Hong Va; Agrawal, Divyakant.

Proceedings - International Conference on Distributed Computing Systems. Piscataway, NJ, United States : IEEE, 1994. p. 227-234.

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

Leong, HV & Agrawal, D 1994, Using message semantics to reduce rollback in optimistic message logging recovery schemes. in Proceedings - International Conference on Distributed Computing Systems. IEEE, Piscataway, NJ, United States, pp. 227-234, Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems, Poznan, Pol, 21/6/94.
Leong HV, Agrawal D. Using message semantics to reduce rollback in optimistic message logging recovery schemes. In Proceedings - International Conference on Distributed Computing Systems. Piscataway, NJ, United States: IEEE. 1994. p. 227-234
Leong, Hong Va ; Agrawal, Divyakant. / Using message semantics to reduce rollback in optimistic message logging recovery schemes. Proceedings - International Conference on Distributed Computing Systems. Piscataway, NJ, United States : IEEE, 1994. pp. 227-234
@inproceedings{f393c04aa0e54248b7f7963ac0523a06,
title = "Using message semantics to reduce rollback in optimistic message logging recovery schemes",
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.",
author = "Leong, {Hong Va} and Divyakant Agrawal",
year = "1994",
month = "12",
day = "1",
language = "English",
pages = "227--234",
booktitle = "Proceedings - International Conference on Distributed Computing Systems",
publisher = "IEEE",

}

TY - GEN

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

AU - Leong, Hong Va

AU - Agrawal, Divyakant

PY - 1994/12/1

Y1 - 1994/12/1

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

SP - 227

EP - 234

BT - Proceedings - International Conference on Distributed Computing Systems

PB - IEEE

CY - Piscataway, NJ, United States

ER -