GATE | GATE CS 2010 | Question 42

Consider the following schedule for transactions T1, T2 and T3: 

Which one of the schedules below is the correct serialization of the above?

(A)

T1->>T3->>T2

(B)

T2->>T1->>T3

(C)

T2->>T3->>T1

(D)

T3->>T1->>T2

Answer: (A)

Explanation:

T1 can complete before T2 and T3 as there is no conflict between Write(X) of T1 and the operations in T2 and T3 which occur before Write(X) of T1 in the above diagram.
T3 should can complete before T2 as the Read(Y) of T3 doesn’t conflict with Read(Y) of T2. Similarly, Write(X) of T3 doesn’t conflict with Read(Y) and Write(Y) operations of T2.
Another way to solve this question is to create a dependency graph and topologically sort the dependency graph. After topologically sorting, we can see the sequence T1, T3, T2.

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save