Nonblocking and orphan-free message logging protocols
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 145-154
- https://doi.org/10.1109/ftcs.1993.627318
Abstract
Currently existing message logging protocols demonstrate a classic pessimistic vs. optimistic tradeoff. It is shown that the optimistic-pessimistic tradeoff is not inherent to the problem of message logging. The authors construct a message-logging protocol that has the positive features of both optimistic and pessimistic protocols: the protocol prevents orphans and allows simple failure recovery; however, it requires no blocking in failure-free runs. Furthermore, this protocol does not introduce any additional message overhead as compared to one implemented for a system in which messages may be lost but processes do not crash.Keywords
This publication has 12 references indexed in Scilit:
- Volatile logging in n-fault-tolerant distributed systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Manetho: transparent roll back-recovery with low overhead, limited rollback, and fast output commitIEEE Transactions on Computers, 1992
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- Recovery in distributed systems using optimistic message logging and checkpointingJournal of Algorithms, 1990
- Efficient distributed recovery using message loggingPublished by Association for Computing Machinery (ACM) ,1989
- Optimistic recovery in distributed systemsACM Transactions on Computer Systems, 1985
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Byzantine generals in actionACM Transactions on Computer Systems, 1984
- PublishingPublished by Association for Computing Machinery (ACM) ,1983
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978