Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking...
-
Upload
zoe-booker -
Category
Documents
-
view
215 -
download
0
Transcript of Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking...
![Page 1: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/1.jpg)
Isolation
6.033 Spring 2010 Lecture 18
Sam MaddenKey concepts:Serial equivalenceTwo-phase lockingDeadlock detection
slides online at http://web.mit.edu/6.033/www/assignments/lec18.[ppt|pdf]
![Page 2: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/2.jpg)
Recover with cell-storage, log, cache, optimized cell-storage
updatesrecover(log):
doneset = { }for each record r in log[len-1] ... log[0]: //UNDO
if r.type == commitdoneset = doneset U r.TID
if r.type == update and r.TID not in doneset:write(cell-storage, r.var, r.before)
for each record r in log[0]...log[len-1]: //REDOif r.type == update and r.TID in doneset:
if (cell-storage does not reflect r)write(cell-storage, r.var, r.after)
![Page 3: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/3.jpg)
Conflicting Operations
Given two transactions T1 and T2, and two operations o1 in T1, o2 in T2
o1 conflicts with o2 if either is a write and both are to the same object
E.g. T1 RA, T2 WA or T1 WB, T2 WB
![Page 4: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/4.jpg)
Testing for Serial Equivalence (Conflict
Serializability)A schedule is serial equivalent if- for all pairs of transactions T1 and
T2,- all conflicting pairs of ops o1 in T1
and o2 in T2 are ordered the same way
E.g., o1 always before o2 or o2 always before o1T1 precedes T2
T1 precedes T2T2 precedes T1
Not serial equivalent!
T1: RA WAT2: RA WA
o1
o2
![Page 5: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/5.jpg)
Locking Protocol
Before reading/writing an object, get lock on it
(If lock isn't available, block)
When to release locks?
![Page 6: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/6.jpg)
Locking Protocol w/ Release
Before reading/writing an object, system acquires lock on it
(If lock isn't available, block)
Release locks after transaction commit
![Page 7: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/7.jpg)
Two Phase Locking(Allows locks to be released before end of transaction)
Phase 1 – system acquires lock before reading or writing an object, up to lock point
Phase 2 – releases locks on objects, after done with them and after lock point(Never acquire locks in phase 2)
![Page 8: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/8.jpg)
Two-phase locking with shared and exclusive locks
Phase 1: Before reading an object, system acquires an S lock on it
Blocks if any other xaction has X lock on object
Before writing an object, system acquires an X lock on it Blocks if any other xaction has X or S lock on object
Phase 2: Release locks on objects, after done with them and after lock point
![Page 9: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/9.jpg)
Transaction Schedule Log
T1 T2lock ARA
lock A (block)WAlock B <--- lock pointrelease A
RAWAlock B (block)
RBWBrelease B
RB WB
BEGIN T1BEGIN T2
UPDATE T1,A
UPDATE T2, A
UPDATE T1, B
UPDATE T2, BCOMMIT T1; COMMIT T2
Schedule Log
![Page 10: Isolation 6.033 Spring 2010 Lecture 18 Sam Madden Key concepts: Serial equivalence Two-phase locking Deadlock detection slides online at ppt|pdf]](https://reader036.fdocuments.in/reader036/viewer/2022082611/56649ef35503460f94c05e4b/html5/thumbnails/10.jpg)
Avoiding cascading aborts
Phase 1: Before reading an object, system acquires an S lock on
itBlocks if any other xaction has X lock on object
Before writing an object, system acquires an X lock on itBlocks if any other xaction has X or S lock on object
Phase 2: Release S locks on objects anytime after done with them and after lock point
Only release X locks after end of transaction