Last Class: Canonical Problems

Slides:



Advertisements
Similar presentations
Concurrency Control III. General Overview Relational model - SQL Formal & commercial query languages Functional Dependencies Normalization Physical Design.
Advertisements

Optimistic Methods for Concurrency Control By : H.T. Kung & John T. Robinson Presenters: Munawer Saeed.
Database Systems (資料庫系統)
1 Concurrency Control Chapter Conflict Serializable Schedules  Two actions are in conflict if  they operate on the same DB item,  they belong.
1 Lecture 11: Transactions: Concurrency. 2 Overview Transactions Concurrency Control Locking Transactions in SQL.
Concurrency Control II
Concurrency Control Enforcing Serializability by Locks
1 CS 194: Elections, Exclusion and Transactions Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.
1 Chapter 3. Synchronization. STEMPusan National University STEM-PNU 2 Synchronization in Distributed Systems Synchronization in a single machine Same.
Database Systems, 8 th Edition Concurrency Control with Time Stamping Methods Assigns global unique time stamp to each transaction Produces explicit.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Distributed Snapshots –Termination detection Election algorithms –Bully –Ring.
CS 582 / CMPE 481 Distributed Systems Concurrency Control.
Synchronization. Physical Clocks Solar Physical Clocks Cesium Clocks International Atomic Time Universal Coordinate Time (UTC) Clock Synchronization Algorithms.
Database management concepts Database Management Systems (DBMS) An example of a database (relational) Database schema (e.g. relational) Data independence.
Transaction Management and Concurrency Control
Synchronization Part 2 REK’s adaptation of Claypool’s adaptation ofTanenbaum’s Distributed Systems Chapter 5 and Silberschatz Chapter 17.
Distributed Systems1 Chapter 7: Distributed Transactions Transaction concepts Centralized/Distributed Transaction Architecture Schedule concepts Locking.
Session - 14 CONCURRENCY CONTROL CONCURRENCY TECHNIQUES Matakuliah: M0184 / Pengolahan Data Distribusi Tahun: 2005 Versi:
Session - 13 CONCURRENCY CONTROL CONCURRENCY TECHNIQUE Matakuliah: M0184 / Pengolahan Data Distribusi Tahun: 2005 Versi:
Transaction Management
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
Synchronization Chapter 5. Clock Synchronization When each machine has its own clock, an event that occurred after another event may nevertheless be assigned.
Synchronization.
Synchronization Chapter 6 Part III Transactions. –Most of the lecture notes are based on slides by Prof. Jalal Y. Kawash at Univ. of Calgary –Some slides.
Concurrency Control in Distributed Databases. By :- Rishikesh Mandvikar rmandvik[at]engr.smu.edu May 1, 2004.
CIS 720 Concurrency Control. Locking Atomic statement –Can be used to perform two or more updates atomically Th1: …. ;……. Th2:…………. ;…….
Solution to Dining Philosophers. Each philosopher I invokes the operations pickup() and putdown() in the following sequence: dp.pickup(i) EAT dp.putdown(i)
Transaction Communications Yi Sun. Outline Transaction ACID Property Distributed transaction Two phase commit protocol Nested transaction.
Real-Time & MultiMedia Lab Synchronization Chapter 5.
1 Mutual Exclusion: A Centralized Algorithm a)Process 1 asks the coordinator for permission to enter a critical region. Permission is granted b)Process.
Concurrency Server accesses data on behalf of client – series of operations is a transaction – transactions are atomic Several clients may invoke transactions.
Global State (1) a)A consistent cut b)An inconsistent cut.
Synchronization Chapter 5. Outline 1.Clock synchronization 2.Logical clocks 3.Global state 4.Election algorithms 5.Mutual exclusion 6.Distributed transactions.
Computer Science Lecture 13, page 1 CS677: Distributed OS Last Class: Canonical Problems Distributed synchronization and mutual exclusion Distributed Transactions.
Computer Science Lecture 13, page 1 CS677: Distributed OS Last Class: Canonical Problems Election algorithms –Bully algorithm –Ring algorithm Distributed.
Page 1 Concurrency Control Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.
Chapter 20 Transaction Management Thomas Connolly, Carolyn Begg, Database System, A Practical Approach to Design Implementation and Management, 4 th Edition,
Transaction Management Transparencies. ©Pearson Education 2009 Chapter 14 - Objectives Function and importance of transactions. Properties of transactions.
Clock Synchronization When each machine has its own clock, an event that occurred after another event may nevertheless be assigned an earlier time.
9 1 Chapter 9_B Concurrency Control Database Systems: Design, Implementation, and Management, Rob and Coronel.
NOEA/IT - FEN: Databases/Transactions1 Transactions ACID Concurrency Control.
10 1 Chapter 10_B Concurrency Control Database Systems: Design, Implementation, and Management, Rob and Coronel.
Synchronization CSCI 4900/6900. Transactions Protects data and allows processes to access and modify multiple data items as a single atomic transaction.
Synchronization Chapter 5. Clock Synchronization When each machine has its own clock, an event that occurred after another event may nevertheless be assigned.
Lecture on Synchronization Submitted by
Computer Science Lecture 13, page 1 CS677: Distributed OS Last Class: Canonical Problems Election algorithms –Bully algorithm –Ring algorithm Distributed.
Atomic Tranactions. Sunmeet Sethi. Index  Meaning of Atomic transaction.  Transaction model Types of storage. Transaction primitives. Properties of.
Transaction Management
Multiple Granularity Granularity is the size of data item  allowed to lock. Multiple Granularity is the hierarchically breaking up the database into portions.
Part- A Transaction Management
Transaction Management Transparencies
Concurrency Control via Validation
Transaction Management
Synchronization Chapter 5C
Outline Introduction Background Distributed DBMS Architecture
Database management concepts
CIS 720 Concurrency Control.
Mutual Exclusion What is mutual exclusion? Single processor systems
Concurrency Control II (OCC, MVCC)
Chapter 10 Transaction Management and Concurrency Control
Concurrency Control Chapter 17
Concurrency Control and Reliable Commit Protocol in Distributed Database Systems Jian Jia Chen 2002/05/09 Real-time and Embedded System Lab., CSIE, National.
Database Transactions
Distributed Database Management Systems
ENFORCING SERIALIZABILITY BY LOCKS
Database management concepts
Introduction of Week 13 Return assignment 11-1 and 3-1-5
Concurrency Control Chapter 17
Chapter 7: Distributed Transactions
Transactions, Properties of Transactions
Presentation transcript:

Last Class: Canonical Problems Election algorithms Ring algorithm Distributed synchronization and mutual exclusion Distributed transactions CS677: Distributed OS

Today: More on Transactions Implementation issues Workspaces Writeahead logs Concurrency control Two phase locks Time stamps CS677: Distributed OS

Transaction Primitives Description BEGIN_TRANSACTION Make the start of a transaction END_TRANSACTION Terminate the transaction and try to commit ABORT_TRANSACTION Kill the transaction and restore the old values READ Read data from a file, a table, or otherwise WRITE Write data to a file, a table, or otherwise Example: airline reservation Begin_transaction if(reserve(NY,Paris)==full) Abort_transaction if(reserve(Paris,Athens)==full)Abort_transaction if(reserve(Athens,Delhi)==full) Abort_transaction End_transaction CS677: Distributed OS

Distributed Transactions A nested transaction A distributed transaction CS677: Distributed OS

Implementation: Private Workspace Each transaction get copies of all files, objects Can optimize for reads by not making copies Can optimize for writes by copying only what is required Commit requires making local workspace global CS677: Distributed OS

Option 2: Write-ahead Logs In-place updates: transaction makes changes directly to all files/objects Write-ahead log: prior to making change, transaction writes to log on stable storage Transaction ID, block number, original value, new value Force logs on commit If abort, read log records and undo changes [rollback] Log can be used to rerun transaction after failure Both workspaces and logs work for distributed transactions Commit needs to be atomic [will return to this issue in Ch. 7] CS677: Distributed OS

Writeahead Log Example y = 0; BEGIN_TRANSACTION; x = x + 1; y = y + 2 x = y * y; END_TRANSACTION; (a) Log [x = 0 / 1] (b) [y = 0/2] (c) [x = 1/4] (d) a) A transaction b) – d) The log before each statement is executed CS677: Distributed OS

Concurrency Control Goal: Allow several transactions to be executing simultaneously such that Collection of manipulated data item is left in a consistent state Achieve consistency by ensuring data items are accessed in an specific order Final result should be same as if each transaction ran sequentially Concurrency control can implemented in a layered fashion CS677: Distributed OS

Concurrency Control Implementation General organization of managers for handling transactions. CS677: Distributed OS

Distributed Concurrency Control General organization of managers for handling distributed transactions. CS677: Distributed OS

Serializability Key idea: properly schedule conflicting operations BEGIN_TRANSACTION x = 0; x = x + 1; END_TRANSACTION (a) BEGIN_TRANSACTION x = 0; x = x + 2; END_TRANSACTION (b) BEGIN_TRANSACTION x = 0; x = x + 3; END_TRANSACTION (c) Schedule 1 x = 0; x = x + 1; x = 0; x = x + 2; x = 0; x = x + 3 Legal Schedule 2 x = 0; x = 0; x = x + 1; x = x + 2; x = 0; x = x + 3; Schedule 3 x = 0; x = 0; x = x + 1; x = 0; x = x + 2; x = x + 3; Illegal Key idea: properly schedule conflicting operations Conflict possible if at least one operation is write Read-write conflict Write-write conflict CS677: Distributed OS

Optimistic Concurrency Control Transaction does what it wants and validates changes prior to commit Check if files/objects have been changed by committed transactions since they were opened Insight: conflicts are rare, so works well most of the time Works well with private workspaces Advantage: Deadlock free Maximum parallelism Disadvantage: Rerun transaction if aborts Probability of conflict rises substantially at high loads Not used widely CS677: Distributed OS

Two-phase Locking Widely used concurrency control technique Scheduler acquires all necessary locks in growing phase, releases locks in shrinking phase Check if operation on data item x conflicts with existing locks If so, delay transaction. If not, grant a lock on x Never release a lock until data manager finishes operation on x One a lock is released, no further locks can be granted Problem: deadlock possible Example: acquiring two locks in different order Distributed 2PL versus centralized 2PL CS677: Distributed OS

Two-Phase Locking Two-phase locking. CS677: Distributed OS

Strict Two-Phase Locking CS677: Distributed OS

Timestamp-based Concurrency Control Each transaction Ti is given timestamp ts(Ti) If Ti wants to do an operation that conflicts with Tj Abort Ti if ts(Ti) < ts(Tj) When a transaction aborts, it must restart with a new (larger) time stamp Two values for each data item x Max-rts(x): max time stamp of a transaction that read x Max-wts(x): max time stamp of a transaction that wrote x CS677: Distributed OS

Reads and Writes using Timestamps Readi(x) If ts(Ti) < max-wts(x) then Abort Ti Else Perform Ri(x) Max-rts(x) = max(max-rts(x), ts(Ti)) Writei(x) If ts(Ti)<max-rts(x) or ts(Ti)<max-wts(x) then Abort Ti Perform Wi(x) Max-wts(x) = ts(Ti) CS677: Distributed OS

Pessimistic Timestamp Ordering Concurrency control using timestamps. CS677: Distributed OS