Presentation is loading. Please wait.

Presentation is loading. Please wait.

Atomic TransactionsCS-4513 D-term 20081 Atomic Transactions in Distributed Systems CS-4513 Distributed Computing Systems (Slides include materials from.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Atomic TransactionsCS-4513 D-term 20081 Atomic Transactions in Distributed Systems CS-4513 Distributed Computing Systems (Slides include materials from."— Presentation transcript:

1 Atomic TransactionsCS-4513 D-term 20081 Atomic Transactions in Distributed Systems CS-4513 Distributed Computing Systems (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz, Galvin, & Gagne, Distributed Systems: Principles & Paradigms, 2 nd ed. By Tanenbaum and Van Steen, and Modern Operating Systems, 2 nd ed., by Tanenbaum)

2 Atomic TransactionsCS-4513 D-term 20082 Definition – Transaction A sequence of operations that perform a single logical function Examples Withdrawing money from your account Making an airline reservation Making a credit-card purchase Registering for a course at WPI... Usually used in context of databases

3 Atomic TransactionsCS-4513 D-term 20083 Definition – Atomic Transaction A transaction that happens completely or not at all No partial results Example: Cash machine hands you cash and deducts amount from your account Airline confirms your reservation and –Reduces number of free seats –Charges your credit card –(Sometimes) increases number of meals loaded onto flight …

4 Atomic TransactionsCS-4513 D-term 20084 Fundamental Principles of Atomic Transactions A C I D –Atomicity – to outside world, transaction happens indivisibly –Consistency – transaction preserves system invariants –Isolated – transactions do not interfere with each other –Durable – once a transaction “commits,” the changes are permanent

5 Atomic TransactionsCS-4513 D-term 20085 Programming in a Transaction System Begin_transaction Mark the start of a transaction End_transaction Mark the end of a transaction and try to “commit” Abort_transaction Terminate the transaction and restore old values Read Read data from a file, table, etc., on behalf of the transaction Write Write data to file, table, etc., on behalf of the transaction

6 Atomic TransactionsCS-4513 D-term 20086 Programming in a Transaction System (continued) As a matter of practice, separate transactions are handled in separate threads or processes Isolated property means that two concurrent transactions are serialized As if one happens first and the other happens second Order is indeterminate

7 Atomic TransactionsCS-4513 D-term 20087 Programming in a Transaction System (continued) Nested Transactions One or more transactions inside another transaction May individually commit, but may need to be undone Example Planning a trip involving three flights Reservation for each flight “commits” individually Must be undone if entire trip cannot commit

8 Atomic TransactionsCS-4513 D-term 20088 Tools for Implementing Atomic Transactions (single system) Stable storage i.e., write to disk “atomically” (ppt (slide 46), html)ppthtml Log file i.e., record actions in a log before “committing” them (ppt (slide 50), html)ppthtml Log in stable storage Locking protocols Serialize Read and Write operations of same data by separate transactions Also enter into log …

9 Atomic TransactionsCS-4513 D-term 20089 Tools for Implementing Atomic Transactions (continued) Begin_transaction Place a begin entry in log Write to file Write updated data to log instead of file Abort_transaction Place abort entry in log End_transaction (i.e., commit) Place commit entry in log Copy logged data to files Place done entry in log Unlock files

10 Atomic TransactionsCS-4513 D-term 200810 Tools for Implementing Atomic Transactions (continued) Crash recovery – search log –If begin entry, look for matching entries –If done, do nothing (all files have been updated) –If abort, undo any permanent changes that transaction may have made Unlock files –If commit but not done, copy updated blocks from log to files, then add done entry

11 Atomic TransactionsCS-4513 D-term 200811 Distributed Atomic Transactions Atomic transactions that span multiple sites and/or systems Same semantics as atomic transactions on single system A C I D Failure modes Crash or other failure of one site or system Network failure or partition Byzantine failures

12 Atomic TransactionsCS-4513 D-term 200812 General Solution – Two-phase Commit Textbook references –Silbershatz, §18.3.1 –Tanenbaum & Van Steen, §8.5 Seminal reference –Jim Gray, “Notes on Database Operating Systems,” in Operating Systems: an Advanced Course, vol 60 of Lecture Notes in Comp. Sci., Springer-Verlag, 1978, pp. 393-481

13 Atomic TransactionsCS-4513 D-term 200813 Two-Phase Commit One site is chosen to be coordinator of the transaction T See Election algorithms Phase 1: When coordinator is ready to commit the transaction Place Prepare(T) state in log on stable storage Send Vote_request(T) message to all other participants Wait for replies

14 Atomic TransactionsCS-4513 D-term 200814 Two-Phase Commit (continued) Phase 2: Coordinator –If any participant replies Abort(T) Place Abort(T) state in log on stable storage Send Global_Abort(T) message to all participants Locally abort transaction T –If all participants reply Ready_to_commit(T) Place Commit(T) state in log on stable storage Send Global_Commit(T) message to all participants Proceed to commit transaction locally

15 Atomic TransactionsCS-4513 D-term 200815 Two-Phase Commit (continued) Phase I: Participant gets Vote_request(T) from coordinator Place Abort(T) or Ready(T) state in local log Reply with Abort(T) or Ready_to_commit(T) message to coordinator If Abort(T) state, locally abort transaction Phase II: Participant Wait for Global_Abort(T) or Global_Commit(T) message from coordinator Place Abort(T) or Commit(T) state in local log Abort or commit locally per message

16 Atomic TransactionsCS-4513 D-term 200816 Two-Phase Commit States coordinatorparticipant PREPARE

17 Atomic TransactionsCS-4513 D-term 200817 Failure Recovery – Two-Phase Commit Failure modes (from coordinator’s point of view) –Own crash –Wait state: No response from some participant to Vote_request message Failure modes (from participant’s point of view) –Own crash –Ready state: No message from coordinator to Global_Abort(T) or Global_Commit(T)

18 Atomic TransactionsCS-4513 D-term 200818 Lack of Response to Coordinator Vote_Request(T) message E.g., –participant crash –Network failure Timeout is considered equivalent to Abort –Place Abort(T) state in log on stable storage –Send Global_Abort(T) message to all participants –Locally abort transaction T

19 Atomic TransactionsCS-4513 D-term 200819 Coordinator Crash Inspect Log If Abort or Commit state –Resend corresponding message –Take corresponding local action If Prepare state, either –Resend Vote_request(T) to all other participants and wait for their responses; or –Unilaterally abort transaction I.e., put Abort(T) in own log on stable store Send Global_Abort(T) message to all participants If nothing in log, abort transaction as above

20 Atomic TransactionsCS-4513 D-term 200820 No Response to Participant’s Ready_to_commit(T) message Re-contact coordinator, ask what to do If unable to contact coordinator, contact other participants, ask if they know If any other participant is in Abort or Commit state Take equivalent action Otherwise, wait for coordinator to restart! –Participants are blocked, unable to go forward or back –Frozen in Ready state!

21 Atomic TransactionsCS-4513 D-term 200821 Participant Crash Inspect local log –Commit state: Redo/replay the transaction –Abort state: Undo/abort the transaction –No records about T: Same as local_abort(T) –Ready State: Same as no response to Ready_to_commit(T) message

22 Atomic TransactionsCS-4513 D-term 200822 Two-Phase Commit Summary Widely used in distributed transaction and database systems Generally works well –When coordinators are likely to reboot quickly –When network partition is likely to end quickly Still subject to participant blocking

23 Atomic TransactionsCS-4513 D-term 200823 Three-Phase Commit Minor variation Widely quoted in literature Rarely implemented Because indefinite blocking due to coordinator failures doesn’t happen very often in real life!

24 Atomic TransactionsCS-4513 D-term 200824 PREPARE Three-Phase Commit (continued) There is no state from which a transition can be made to either Commit or Abort There is no state where it is not possible to make a final decision and from which transition can be made to Commit.

25 Atomic TransactionsCS-4513 D-term 200825 Three-Phase Commit (continued) Coordinator sends Vote_Request (as before) If all participants respond affirmatively, Put Precommit state into log on stable storage Send out Prepare_to_Commit message to all After all participants acknowledge, Put Commit state in log Send out Global_Commit

26 Atomic TransactionsCS-4513 D-term 200826 Three-Phase Commit Failures Coordinator blocked in Ready state Safe to abort transaction Coordinator blocked in Precommit state Safe to issue Global_Commit Any crashed or partitioned participants will commit when recovered …

27 Atomic TransactionsCS-4513 D-term 200827 Three-Phase Commit Failures (continued) Participant blocked in Precommit state Contact others Collectively decide to commit Participant blocked in Ready state Contact others If any in Abort, then abort transaction If any in Precommit, the move to Precommit state …

28 Atomic TransactionsCS-4513 D-term 200828 Three-Phase Commit Summary If any processes are in Precommit state, then all crashed processes will recover to Ready, Precommit, or Committed states If any process is in Ready state, then all other crashed processes will recover to Init, Abort, or Precommit Surviving processes can make collective decision

29 Atomic TransactionsCS-4513 D-term 200829 Questions?

Download ppt "Atomic TransactionsCS-4513 D-term 20081 Atomic Transactions in Distributed Systems CS-4513 Distributed Computing Systems (Slides include materials from."

Similar presentations

CS542: Topics in Distributed Systems Distributed Transactions and Two Phase Commit Protocol.

CS542: Topics in Distributed Systems Distributed Transactions and Two Phase Commit Protocol.
(c) Oded Shmueli 20041 Distributed Recovery, Lecture 7 (BHG, Chap.7)

(c) Oded Shmueli Distributed Recovery, Lecture 7 (BHG, Chap.7)
1 Chapter 3. Synchronization. STEMPusan National University STEM-PNU 2 Synchronization in Distributed Systems Synchronization in a single machine Same.

1 Chapter 3. Synchronization. STEMPusan National University STEM-PNU 2 Synchronization in Distributed Systems Synchronization in a single machine Same.
Chap 16. Transactions. Transactions Transaction: sequence of operations such that the entire sequence appears as one indivisible operation Indivisibility.

Chap 16. Transactions. Transactions Transaction: sequence of operations such that the entire sequence appears as one indivisible operation Indivisibility.
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture X: Transactions.

CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture X: Transactions.
COS 461 Fall 1997 Transaction Processing u normal systems lose their state when they crash u many applications need better behavior u today’s topic: how.

COS 461 Fall 1997 Transaction Processing u normal systems lose their state when they crash u many applications need better behavior u today’s topic: how.
1 ICS 214B: Transaction Processing and Distributed Data Management Lecture 12: Three-Phase Commits (3PC) Professor Chen Li.

1 ICS 214B: Transaction Processing and Distributed Data Management Lecture 12: Three-Phase Commits (3PC) Professor Chen Li.
Computer Science Lecture 18, page 1 CS677: Distributed OS Last Class: Fault Tolerance Basic concepts and failure models Failure masking using redundancy.

Computer Science Lecture 18, page 1 CS677: Distributed OS Last Class: Fault Tolerance Basic concepts and failure models Failure masking using redundancy.
Jan. 2014Dr. Yangjun Chen ACS-49021 Database recovery techniques (Ch. 21, 3 rd ed. – Ch. 19, 4 th and 5 th ed. – Ch. 23, 6 th ed.)

Jan. 2014Dr. Yangjun Chen ACS Database recovery techniques (Ch. 21, 3 rd ed. – Ch. 19, 4 th and 5 th ed. – Ch. 23, 6 th ed.)
CMPT 401 2008 Dr. Alexandra Fedorova Lecture X: Transactions.

CMPT Dr. Alexandra Fedorova Lecture X: Transactions.
OCT Distributed Transaction1 Lecture 13: Distributed Transactions Notes adapted from Tanenbaum’s “Distributed Systems Principles and Paradigms”

OCT Distributed Transaction1 Lecture 13: Distributed Transactions Notes adapted from Tanenbaum’s “Distributed Systems Principles and Paradigms”
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Distributed Snapshots –Termination detection Election algorithms –Bully –Ring.

Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Distributed Snapshots –Termination detection Election algorithms –Bully –Ring.
Systems of Distributed Systems Module 2 -Distributed algorithms Teaching unit 3 – Advanced algorithms Ernesto Damiani University of Bozen Lesson 6 – Two.

Systems of Distributed Systems Module 2 -Distributed algorithms Teaching unit 3 – Advanced algorithms Ernesto Damiani University of Bozen Lesson 6 – Two.
Computer Science Lecture 17, page 1 CS677: Distributed OS Last Class: Fault Tolerance Basic concepts and failure models Failure masking using redundancy.

Computer Science Lecture 17, page 1 CS677: Distributed OS Last Class: Fault Tolerance Basic concepts and failure models Failure masking using redundancy.
Synchronization. Physical Clocks Solar Physical Clocks Cesium Clocks International Atomic Time Universal Coordinate Time (UTC) Clock Synchronization Algorithms.

Synchronization. Physical Clocks Solar Physical Clocks Cesium Clocks International Atomic Time Universal Coordinate Time (UTC) Clock Synchronization Algorithms.
Non-blocking Atomic Commitment Aaron Kaminsky Presenting Chapter 6 of Distributed Systems, 2nd edition, 1993, ed. Mullender.

Non-blocking Atomic Commitment Aaron Kaminsky Presenting Chapter 6 of Distributed Systems, 2nd edition, 1993, ed. Mullender.
Atomic TransactionsCS-502 Fall 20071 Atomic Transactions in Distributed Systems CS-502, Operating Systems Fall 2007 (Slides include materials from Operating.

Atomic TransactionsCS-502 Fall Atomic Transactions in Distributed Systems CS-502, Operating Systems Fall 2007 (Slides include materials from Operating.
Synchronization Part 2 REK’s adaptation of Claypool’s adaptation ofTanenbaum’s Distributed Systems Chapter 5 and Silberschatz Chapter 17.

Synchronization Part 2 REK’s adaptation of Claypool’s adaptation ofTanenbaum’s Distributed Systems Chapter 5 and Silberschatz Chapter 17.
SynchronizationCS-4513, D-Term 20071 Synchronization in Distributed Systems CS-4513 D-Term 2007 (Slides include materials from Operating System Concepts,

SynchronizationCS-4513, D-Term Synchronization in Distributed Systems CS-4513 D-Term 2007 (Slides include materials from Operating System Concepts,
Replication and Consistency CS-4513 D-term 20081 Replication and Consistency CS-4513 Distributed Computing Systems (Slides include materials from Operating.

Replication and Consistency CS-4513 D-term Replication and Consistency CS-4513 Distributed Computing Systems (Slides include materials from Operating.

Similar presentations

Ads by Google