1,167 views
1 votes
1 votes
Consider 2 schedules S1 and S2 with same set of transactions and precedence graph of S1 is
same as precedence graph of S2. Which of the following statement is True?

(a) Both S1 and S2 are conflict equal and conflict serializable schedule
(b) Both S1 and S2 are conflict equal but may not conflict serializable schedule
(c) Both S1 and S2 are conflict equal but may not equal schedules
(d) Both S1 and S2 are conflict equal and but may not view equivalent

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
10 votes
10 votes
2 answers
4
Kathleen asked Sep 13, 2014
3,549 views
Draw the precedence graph for the concurrent program given belowS1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9