Question#1:
Draw “Conflict Serializability” graph for given schedule and
tell if schedule is serializable or not.
Question 1 Draw Conflict Serializability Graph For Given Schedule And Tell If Schedule Is Serializable Or Not Note 1 (44.77 KiB) Viewed 38 times
Note:
Give correct solution as soon as possible
time to toi to₂ to3 to4 tos tos to7 tos tog t₁0 t₁1 T1 Read(x) x=x+10 write(x) read(a) a=a+50 commit T2 Read(t) t=t-20 read(b) b=b+t read(e) e=e+80 Write(e) Write(b) commit T3 Read(y) y=y*2 y=y+100 Read(c) Read(z) Z=Z+C write(z) commit T5 Read(z) Z=Z+50 write(z) read(y) y=y*5 Write(y) commit
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!