Read information from following table carefully and check whether the following schedule contains a deadlock or not by constructing wait for graph?
A schedule S= {T1, T2, T3, T4, T5, T6, T7, T8} is shown with following information.
Transactions Holding Locks
Transaction waiting for Locks
Data item on which lock is required
T2------T1---A
T8----T3------B
T3-----T4------C
T4----T7------D
T5----T2-----X
T6----T8----Y
T3----T6----Z
The above schedule contain a deadlock. This is because T3 is waiting for T8, T8 is waiting for T6 and T6 is waiting for T3 hence they will not come out of this loop.
Comments
Leave a comment