Atomic Transactions in Distributed Systems

Slides:



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

(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.
Chap 16. Transactions. Transactions Transaction: sequence of operations such that the entire sequence appears as one indivisible operation Indivisibility.
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.
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.)
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.
Systems of Distributed Systems Module 2 -Distributed algorithms Teaching unit 3 – Advanced algorithms Ernesto Damiani University of Bozen Lesson 6 – Two.
CS 582 / CMPE 481 Distributed Systems
Synchronization. Physical Clocks Solar Physical Clocks Cesium Clocks International Atomic Time Universal Coordinate Time (UTC) Clock Synchronization Algorithms.
Atomic TransactionsCS-4513 D-term Atomic Transactions in Distributed Systems CS-4513 Distributed Computing Systems (Slides include materials from.
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.
Chapter 8 : Transaction Management. u Function and importance of transactions. u Properties of transactions. u Concurrency Control – Meaning of serializability.
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 Replication and Consistency CS-4513 Distributed Computing Systems (Slides include materials from Operating.
Synchronization in Distributed Systems CS-4513 D-term Synchronization in Distributed Systems CS-4513 Distributed Computing Systems (Slides include.
©Silberschatz, Korth and Sudarshan19.1Database System Concepts Distributed Transactions Transaction may access data at several sites. Each site has a local.
1 More on Distributed Coordination. 2 Who’s in charge? Let’s have an Election. Many algorithms require a coordinator. What happens when the coordinator.
CS 425 / ECE 428 Distributed Systems Fall 2014 Indranil Gupta (Indy) Lecture 18: Replication Control All slides © IG.
1 ICS 214B: Transaction Processing and Distributed Data Management Distributed Database Systems.
Distributed Commit. Example Consider a chain of stores and suppose a manager – wants to query all the stores, – find the inventory of toothbrushes at.
Transaction Management WXES 2103 Database. Content What is transaction Transaction properties Transaction management with SQL Transaction log DBMS Transaction.
CMPT Dr. Alexandra Fedorova Lecture XI: Distributed Transactions.
TRANSACTION PROCESSING TECHNIQUES BY SON NGUYEN VIJAY RAO.
Commit Protocols. CS5204 – Operating Systems2 Fault Tolerance Causes of failure: process failure machine failure network failure Goals : transparent:
Advanced Database Technologies Lecture 6: Transactions and Database Recovery.
Distributed Commit Dr. Yingwu Zhu. Failures in a distributed system Consistency requires agreement among multiple servers – Is transaction X committed?
CS162 Section Lecture 10 Slides based from Lecture and
Chapter 19 Recovery and Fault Tolerance Copyright © 2008.
Transaction Communications Yi Sun. Outline Transaction ACID Property Distributed transaction Two phase commit protocol Nested transaction.
Distributed Transactions Chapter 13
PAVANI REDDY KATHURI TRANSACTION COMMUNICATION. OUTLINE 0 P ART I : I NTRODUCTION 0 P ART II : C URRENT R ESEARCH 0 P ART III : F UTURE P OTENTIAL 0 R.
Chapter 15 Recovery. Topics in this Chapter Transactions Transaction Recovery System Recovery Media Recovery Two-Phase Commit SQL Facilities.
Fault Tolerance CSCI 4780/6780. Distributed Commit Commit – Making an operation permanent Transactions in databases One phase commit does not work !!!
Global State (1) a)A consistent cut b)An inconsistent cut.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved Chapter 8 Fault.
Computer Science Lecture 13, page 1 CS677: Distributed OS Last Class: Canonical Problems Election algorithms –Bully algorithm –Ring algorithm Distributed.
Commit Algorithms Hamid Al-Hamadi CS 5204 November 17, 2009.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved Chapter 8 Fault.
Chapter 10 Recovery System. ACID Properties  Atomicity. Either all operations of the transaction are properly reflected in the database or none are.
Transactions. Transaction: Informal Definition A transaction is a piece of code that accesses a shared database such that each transaction accesses shared.
Distributed DBMSPage © 1998 M. Tamer Özsu & Patrick Valduriez Outline Introduction Background Distributed DBMS Architecture Distributed Database.
Atomic Tranactions. Sunmeet Sethi. Index  Meaning of Atomic transaction.  Transaction model Types of storage. Transaction primitives. Properties of.
Chapter 8 – Fault Tolerance Section 8.5 Distributed Commit Heta Desai Dr. Yanqing Zhang Csc Advanced Operating Systems October 14 th, 2015.
Distributed Databases – Advanced Concepts Chapter 25 in Textbook.
Database recovery techniques
Transactions.
Chapter 19: Distributed Databases
Outline Introduction Background Distributed DBMS Architecture
CSC 8320 Advanced Operating Systems Xueting Liao
Database System Implementation CSE 507
Two phase commit.
Operating System Reliability
Commit Protocols CS60002: Distributed Systems
Outline Announcements Fault Tolerance.
Mutual Exclusion What is mutual exclusion? Single processor systems
Operating System Reliability
CSE 486/586 Distributed Systems Concurrency Control --- 3
Outline Introduction Background Distributed DBMS Architecture
Lecture 21: Replication Control
Causal Consistency and Two-Phase Commit
Operating System Reliability
Distributed Databases Recovery
UNIVERSITAS GUNADARMA
Lecture 21: Replication Control
Last Class: Fault Tolerance
Transaction Communication
Presentation transcript:

Atomic Transactions in Distributed Systems CS-4513 D-Term 2007 (Slides include materials from Operating System Concepts, 7th ed., by Silbershatz, Galvin, & Gagne, Modern Operating Systems, 2nd ed., by Tanenbaum, and Distributed Systems: Principles & Paradigms, 2nd ed. By Tanenbaum and Van Steen) Assumptions: Graduate level Operating Systems Making Choices about operation systems Why a micro-century? …just about enough time for one concept CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

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 on flight … CS-4513, D-Term 2007 Atomic Transactions

Atomic Transaction Review Textbook references Silbershatz, §6.9 Tanenbaum & Van Steen, §1.3.2 CS-4513, D-Term 2007 Atomic Transactions

Atomic Transaction Review Fundamental principles – 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 CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

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 I.e., they run in some indeterminate order with respect to each other CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

Tools for Implementing Atomic Transactions (single system) Stable storage i.e., write to disk “atomically” (ppt, html) Log file i.e., record actions in a log before “committing” them (ppt, html) Log in stable storage Locking protocols Serialize Read and Write operations of same data by separate transactions … CS-4513, D-Term 2007 Atomic Transactions

Tools for Implementing Atomic Transactions (continued) Begin_transaction Place a begin entry in log Write Write updated data to log 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 CS-4513, D-Term 2007 Atomic Transactions

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 If commit but not done, copy updated blocks from log to files, then add done entry CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

Two-Phase Commit One site is elected coordinator of the transaction T See Election algorithms (ppt, html) 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 CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

Two-Phase Commit States PREPARE coordinator participant CS-4513, D-Term 2007 Atomic Transactions

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) Ready state: No message from coordinator to Global_Abort(T) or Global_Commit(T) CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

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! CS-4513, D-Term 2007 Atomic Transactions

Participant Crash Inspect local log Commit state: Abort 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 CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

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! CS-4513, D-Term 2007 Atomic Transactions

Three-Phase Commit (continued) PREPARE 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. CS-4513, D-Term 2007 Atomic Transactions

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 CS-4513, D-Term 2007 Atomic Transactions

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 … CS-4513, D-Term 2007 Atomic Transactions

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

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 CS-4513, D-Term 2007 Atomic Transactions

Questions? CS-4513, D-Term 2007 Atomic Transactions