1. CS162 Section Lecture 10 Slides based from Lecture and www.news.cs.nyu.edu/~jinyang/fa08/

2. Problems with Interleaved Execution T1:R(A), R(A),W(A) T2: R(A),W(A) What type of conflict is this?

3. Problems with Interleaved Execution What type of conflict is this? T1:R(A),W(A), W(A) T2: R(A), …

4. Problems with Interleaved Execution What type of conflict is this? T1:W(A), W(B) T2: W(A),W(B)

5. What is conflict equivalence?

6. Conflict Serializability T1:R(A),W(A), R(B),W(B) T2: R(A),W(A), R(B),W(B) T1:R(A),W(A), R(B), W(B) T2: R(A), W(A), R(B),W(B) T1:R(A),W(A),R(B), W(B) T2: R(A),W(A), R(B),W(B)

7. T1T2 A Dependency graph B T1:R(A),W(A), R(B),W(B) T2: R(A),W(A), R(B),W(B)

8. T1:R(A),W(A), R(B),W(B) T2: R(A),W(A),R(B),W(B) T1T2 A B Dependency graph

9. 2 Phase Locking 1) Each transaction must obtain: – S (shared) or X (exclusive) lock on data before reading, – X (exclusive) lock on data before writing 2) A transaction can not request additional locks once it releases any locks Thus, each transaction has a “growing phase” followed by a “shrinking phase” Growing Phase Shrinking Phase

10. Assume each instruction (R, W, etc) takes one time unit, and lock ops takes zero time units. What is the minimum possible execution time schedule? Transaction 1: R(A); A = A + 100; W(A); R(B); B = B – 100; W(B); Transaction 2: R(A); A = A – 50; W(A); 2 PL Example

12. What if you used strict 2 PL?

13. Why 2PC? Most of the real time transactions are distributed transactions. A distributed transaction involves altering data on multiple databases A database must coordinate the committing or rolling back of the changes in a transaction

14. Failures in a distributed system Consistency requires agreement among multiple servers – Is transaction X committed? – Have all servers applied update X to a replica? Achieving agreement w/ failures is hard – Impossible to distinguish host vs. network failures

15. Two Phase commit (2PC) It is a standard protocol for making commit and abort atomic Coordinator - the component that coordinates commitment at home(T) Participant - a resource manager accessed by T A participant P is ready to commit T if all of T’s after-images at P are in stable storage

16. 2PC contd… 16 directoractors RM director Commit Ready Commit TM: Transaction Manager RM: Resource Manager client TM RM Ready?

17. Do you remember the State Machine of Coordinator from the lecture? INIT WAIT ABORTCOMMIT Recv: VOTE-ABORT Send: GLOBAL-ABORT Recv: VOTE-COMMIT Send: GLOBAL-COMMIT Recv: START Send: VOTE-REQ

18. State Machine of workers INIT READY ABORTCOMMIT Recv: VOTE-REQ Send: VOTE-ABORT Recv: VOTE-REQ Send: VOTE-COMMIT Recv: GLOBAL-ABORTRecv: GLOBAL-COMMIT

19. Example Bank ABank B Transfer $1000 From A:$3000 To B:$2000 Clients want all-or-nothing transactions – Transfer either happens or not at all client

20. Strawman solution Bank ABank B Transfer $1000 From A:$3000 To B:$2000 client Transaction coordinator

21. Strawman solution What can go wrong? – A does not have enough money – B’s account no longer exists – B has crashed – Coordinator crashes client transaction coordinator bank Abank B start done A=A-1000 B=B+1000

22. Reasoning about correctness TC, A, B each has a notion of committing Correctness: – If one commits, no one aborts – If one aborts, no one commits Performance: – If no failures, A and B can commit, then commit – If failures happen, find out outcome soon

23. Correctness first client transaction coordinator bank Abank B start result prepare rBrB rArA outcome If r A ==yes && r B ==yes outcome = “commit” else outcome = “abort” B commits upon receiving “commit”

24. Performance Overhead TM LOGMessageRM Log PREPARE Prepare / abort VOTE Y/N Commit / abort C/A Commit / abort ACK End*

25. Performance Issues What about timeouts? – TC times out waiting for A’s response – A times out waiting for TC’s outcome message What about reboots? – How does a participant clean up?

26. Handling timeout on A/B TC times out waiting for A (or B)’s “yes/no” response Can TC unilaterally decide to commit? Can TC unilaterally decide to abort?

27. Handling timeout on TC If B responded with “no” … – Can it unilaterally abort? If B responded with “yes” … – Can it unilaterally abort? – Can it unilaterally commit?

28. What would happen if a single GLOBAL-COMMIT message was lost?

29. When can the TM respond with a SUCCESS? client transaction coordinator bank Abank B start result prepare rBrB rArA outcome

30. Possible termination protocol Execute termination protocol if B times out on TC and has voted “yes” B sends “status” message to A – If A has received “commit”/”abort” from TC … – If A has not responded to TC, … – If A has responded with “no”, … – If A has responded with “yes”, … Resolves most failure cases except sometimes when TC fails

31. Handling crash and reboot Nodes cannot back out if commit is decided TC crashes just after deciding “commit” – Cannot forget about its decision after reboot A/B crashes after sending “yes” – Cannot forget about their response after reboot

32. Handling crash and reboot All nodes must log protocol progress What and when does TC log to disk? What and when does A/B log to disk?

33. Recovery upon reboot If TC finds no “commit” on disk, abort If TC finds “commit”, commit If A/B finds no “yes” on disk, abort If A/B finds “yes”, run termination protocol to decide

34. Summary: two-phase commit 1.All nodes that decide reach the same decision 2.No commit unless everyone says "yes". 3.No failures and all "yes", then commit. 4.If failures, then repair, wait long enough for recovery, then some decision.