Scribd
Upload
13 views15 pages

CS 194: Two-Phase Commit Protocol

This document summarizes key concepts related to distributed commit and recovery in distributed systems: 1) Two-phase commit (2PC) is a protocol that allows processes to agree whether to commit or abort a transaction in a distributed system despite failures. It uses a coordinator and participants. 2) Stable storage is used to log actions during 2PC to allow processes to recover after crashes and determine their commit decision. 3) Checkpointing involves periodically saving process state to stable storage to enable backward or forward recovery from failures through rollback or restart from a known good state. Message logging is another recovery technique.

Uploaded by

Karthik Kannan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
13 views15 pages

CS 194: Two-Phase Commit Protocol

This document summarizes key concepts related to distributed commit and recovery in distributed systems: 1) Two-phase commit (2PC) is a protocol that allows processes to agree whether to commit or abort a transaction in a distributed system despite failures. It uses a coordinator and participants. 2) Stable storage is used to log actions during 2PC to allow processes to recover after crashes and determine their commit decision. 3) Checkpointing involves periodically saving process state to stable storage to enable backward or forward recovery from failures through rollback or restart from a known good state. Message logging is another recovery technique.

Uploaded by

Karthik Kannan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd

CS 194: Distributed Systems Distributed Commit, Recovery

Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720-1776

Distributed Commit

Goal: Either all members of a group decide to perform an operation, or none of them perform the operation

Assumptions

Failures:
- Crash failures that can be recovered - Communication failures detectable by timeouts

Notes:
- Commit requires a set of processes to agree - similar to the Byzantine general problem - but the solution much simpler because stronger assumptions

Two Phase Commit (2PC)


Coordinator
send VOTE_REQ to all send vote to coordinator if (vote == no) decide abort halt if (all votes yes) decide commit send COMMIT to all else decide abort send ABORT to all who voted yes halt Participants

if receive ABORT, decide abort else decide commit halt 4

2PC State Machine

a) b)

The finite state machine for the coordinator in 2PC The finite state machine for a participant

2PC: Crash Recovery Protocol


Stable storage is persistent memory that supports writes that are atomic with respect to failures Log actions: c sends VOTE_REQ write start p votes YES write yes p votes NO write abort commit point c decides commit write commit c decides abort write abort p receives decision write decision

2PC: Crash Recovery Protocol


Upon recovery a process r starts reading the values logged to stable storage. If there is a start then r was the coordinator: - If there is a subsequent abort or commit then decision was made; otherwise decide abort. Otherwise, r was a participant: - If there is abort or commit then the decision was made; - If there is no yes then decide abort. - Otherwise (i.e., there is an yes record) run termination protocol. ... when can these records be garbage collected?
7

Recovery Techniques: Checkpoints

Goal: recover a process from error Backward recovery: checkpoint the state of the process periodically
- Go to previous checkpoint, if error - Problem: same failure may repeat

Forward recovery: go to a known good state if error


- Problem: need to know in advance which error may occur

Example: Reliable Communication

Backward recovery: retransmit packet if lost

Forward recovery: use erasure coding


- Instead of sending k packets, send n > k using erasure coding - As long as receiver gets at least k packets out of n, it can reconstruct the original k packets

Recovery Techniques: Message Logging

Sender based: sender logs message before sending it out Receiver based: receiver logs message before delivering it Replay log messages between checkpoints restore state beyond most recent checkpoint

10

Distributed Checkpointing: Recovery Line

Recovery line: most recent snapshot


- If a process P has recorder the receipt of message m there should be a process Q that recorded sending of message m

How do you find a recover line?


11

Independent Checkpointing: The Domino Effect

Domino effect: cascaded rollback to find a recovery line Solutions:


- Coordinate checkpointing: use two-phase non-blocking protocol (see the book) - Logging and replaying messages
12

Message Logging and Checkpointing

Incorrect replay of messages after recovery, leading to an orphan process


13

Stable Storage

Storage designed to survive anything except major calamities

Use two disks to record identical information


1) Write and verify sector on disk 1 2) Write and verify sector on disk 2

Recovery
Verify all sectors If two corresponding sectors differ, copy sector from disk 1 to disk

14

Stable Storage Recovery

a) b) c)

Stable Storage Crash after drive 1 is updated Bad spot

15

You might also like