In a database system, unique timestamps are assigned to each transaction using Lamport’s logical clock. Let TS(T₁) and TS(T₂) be the timestamps of transactions T₁and T₂respectively. Besides, T₁ holds a lock on the resource R, and T₂has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp.
If TS(T₂) < TS(T₁) then
T₁is killed
else T₂waits.
Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?

Question

Examsnet · Accepted Answer

Correct Answer is : The database system is both deadlock-free and starvation-free.

GATE Computer Science (CS) 2017 Shift 1 Solved Paper