Question 6 (Total 10 points) - Concurrency Control
6.15 points
For the following schedule, draw the serializability graph (also known as precedence graph or conflict graph) and determine:
a) Is the schedule conflict serializable or not?
b) Explain why or why not.
T1 R(x)
T3
T2
R(z)
R(z)
R(x) R(y) W(x)
R(v) W(z) W(v)
6.25 points
Draw the Wait-for-Graph and determine:
a) Is there a deadlock or not?
b) Explain why or why not.
T17
T18 T19 T20 Lock-S(B) R(B) Lock-S(B) R(B) Lock-S(A) Lock-S(D) R(A) R(D) Lock-X(B) WB) Lock-X(B) W(B) Lock-X(D) Lock-S(B) W(D) R[B]
T17 is waiting for T18 and T19.
T19 is waiting for T18.
T18 is waiting for T20.
T20 is waiting for T19.
Page 10 | 10