Question

Consider the three transactions T1, T2, and T3, and the schedules S1 and S2 given below.

Draw the serializability (precedence) graphs for S1 and S2, and state whether each schedule is serializable or not.

If a schedule is serializable, write down the equivalent serial schedule(s).

T1: r1 (X); r1 (Z); w1 (X);

T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y);

T3: r3 (X); r3 (Y); w3 (Y);

S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);

S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y);

Answer 1

Answer

The answer and procedures of the exercise are attached in a microsoft excel document.  

Explanation  

Please consider the data provided by the exercise. If you have any question please write me back. All the exercises are solved in a single sheet with the formulas indications.