Homework answers / question archive / Your next interview is with Montgomery Burns, Who thinks he can one-up Gekko Gordon and so he comes up with an "Excellent!" scheme

Your next interview is with Montgomery Burns, Who thinks he can one-up Gekko Gordon and so he comes up with an "Excellent!" scheme

Computer Science

Share With

Your next interview is with Montgomery Burns, Who thinks he can one-up Gekko Gordon and so he comes up with an "Excellent!" scheme. Mr. Burns presents you a transaction system Where he has each transaction acquiring a lock for an object just in time, right before the transaction's ?rst access to that object, and then the transaction releases the lock object right after the last access of that transaction to that object. a. Will this system satisfy serial equivalence? Give a proof / counterexample (as appropriate). b. Can this scheme deadlock? Give a proof / counterexample (as appropriate).