Answer Happy

Question 7 12 pts Question 7 (12 marks): Concurrency Control Consider the following schedule, TO T2 T3 Read(x) Read(z) Write (z) Commit Writely) Write(x) Commit Writely) Commit
(a) (3 marks) If C2PL is used for concurrency control. Is there any deadlock and which transactions are involved in the deadlock? (b) (3 marks) If S2PL is used for concurrency control. Is there any deadlock and which transactions are involved in the deadlock? (c) (6 marks) If B2PL is used for concurrency control, and the Wound-Wait method is used for resolving deadlock. Suppose the time-stamp of T, is older than the time-stamp of T, which in turn is older than the time-stamp of T3, show the schedule (also include the restarted transactions in your schedule) in the table format as shown above. You may use: • RLock(x) to set a read lock on data item x • WLock(x) to set a write lock on data item x Unlock(x) to release either read or write lock.