In: Computer Science
Consider the following schedule S (ri(X): Ti reads X; wi(X): Ti writes X; Ci: Commit Ti):
r1 (X) ; r2 (X) ; r2 (Y) ; r3 (Z) ; r3 (Y) ; w1 (X) ; r1 (Y) ; w3 (Z) ; C3 ; w2 (X) ; C1; C2;
a. Strict 2PL with deadlock detection. (Show the waits-for graph if there is a deadlock)
b. Timestamping