Consider the following precedence graph for a non-serial schedule S consisting o
ID: 3547240 • Letter: C
Question
Consider the following precedence graph for a non-serial schedule S consisting of transactions
T0, T1, T2, T3 and T4:
T0 T1
T3 T2
T4
(a) Is the corresponding schedule S conflict serializable? Why?
(b) If you answered "yes" (S is conflict serializable) to part (a), then give a serial schedule S
Consider the following precedence graph for a non-serial schedule S consisting of transactions T0, T1, T2, T3 and T4: Is the corresponding schedule S conflict serializable? Why? If you answered "yes" (S is conflict serializable) to part (a), then give a serial schedule S¢ (for the transactions T0, T1, T2, T3 and T4) such that the serial schedule S¢ is compatible with the partial order specified by the above precedence graph.Explanation / Answer
A)
Yes the corresponding schedule S is conflict Serializable since there is no cycle in the given graph.
B)
If in precedence graph there is edge from Ti to Tj it means that Ti must come before Tj.
so from the given precedence graph it is clear that
before T0, T3 should come.
before T1, T2 and T0 should come.