Unformatted text preview: 3 (y); w 3 (y) S 1 : r 1 (x); r 2 (z); r 1 (z) ; r 3 (x); r 3 (y); w 1 (x); w 3 (y); r 2 (y); w 2 (z); w 2 (y) S 2 : r 1 (x); r 2 (z); r 3 (x); r 1 (z); r 2 (y); r 3 (y); w 1 (x); w 2 (z); w 3 (y); w 2 (y) 4. Discuss the problems of deadlock and starvation, and the different approaches to dealing with these problems. 5. Discuss the waitdie and woundwait protocols for deadlock prevention. 6. Prove that the basic twophase locking protocol guarantees conflict serializability of schedules. (Hint: Show that, if a serializability graph for a schedule has a cycle, then at least one of the transactions participating in the schedule does not obey the twophase locking protocol.)...
View
Full
Document
This note was uploaded on 01/05/2012 for the course IM 100 taught by Professor Ccc during the Spring '11 term at National Taipei University.
 Spring '11
 CCC

Click to edit the document details