Given the following schedule, show the locks that will occur and the subsequent schedule. Assume that strict 2PL is in effect, w
ith no deadlock prevention and no starvation prevention. Assume that upgrading locks are allowed, downgrades are not. Assume that requests will be satisfied in the order of arrival if possible.
T1:R(X), T2:R(Q), T3:R(Q), T(2):R(X), T3:R(X), T2:W(X), T2:Commit, T3:Abort, T1:W(X), T1:Commit
T1:R(X), T2:R(Q), T3:R(Q), T(2):R(X), T3:R(X), T2:W(X), T2:Commit, T3:Abort, T1:W(X), T1:Commit
1 answer:
You might be interested in