Solutions i ii

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: it for acquire the lock for x =read(i)? If the answer to any of the questions is yes, specify at what time the transaction can acquire the lock. Do transactions T and V eventually commit? If the answer is yes, in what order? Solutions: (i) (ii) Does V have to wait to acquire the lock for write(k; 88)? Yes, V must wait for the Write lock on ‘k’ until after T commits. Does T have to wait to acquire the lock for x =read(i)? If the answer to any of the questions is yes, specify at what time the transaction can acquire the lock. Does U have to wait toacquire the lock for x =read(k)? No, T and U can share the read lock on ‘k’ (read‐read are not in conflict). (iii) Yes, T can’t...
View Full Document

This note was uploaded on 02/07/2013 for the course CS 425 taught by Professor Hu during the Spring '08 term at University of Illinois, Urbana Champaign.

Ask a homework question - tutors are online