One way to manage locks is the wait-die system. Consider the…
One way to manage locks is the wait-die system. Consider the following three transactions. T1: lock A; lock B; unlock A; unlock B T2: lock A; lock B; unlock B; unlock A T3: lock A; lock C; unlock A; unlock C Suppose we allow these transactions to execute in a round-robin fashion. When it is a transaction’s turn, it executes its next lock or unlock step if it can, and otherwise waits or dies, as appropriate. Assume that each transaction is given its deadlock timestamp the first time it executes a step. Determine the sequence of steps that the the three transactions make, including all die/rollback steps (which take place in a single round of the round-robin) and the restarts of transactions. Then, identify the true statement below about how many times a transaction dies or waits.