a) Show an example of a strict 2PL implementation that leads to a deadlock
2. DEL (30 %): Transactions:
The following transaction schedule is given. A,B,C are the addresses of the records
in the
T1 R(A)W(A) R(C) R(B)W(B)C
-----------------------------------------------------------------------------------------------------------------
T2 R(B) W(B) R(A) W(A)C
-----------------------------------------------------------------------------------------------------------------
T3 R(C) R(B)W(B) C
a) Show an example of a strict 2PL implementation that leads to a deadlock
b) For a) draw a »wait-for« graph
c) Avoid the previously drawn deadlock with a »wait-die« policy
d) Give an example of another schedule that would be conflict-equivalent to the
given schedule of transactions
Step by step
Solved in 4 steps with 2 images
