Assignment 2: Distributed Recovery

Start date 16 February, due beginning of class 23 February.

Complete the following exercises:

  1. Give an example of a schedule that will deadlock under at least one of 2-phase locking, strict 2-phase locking, or timestamp ordering; but will not deadlock under at least one. Show how the deadlock would be detected.
  2. (Book: 12.3): Design a 3PC protocol using the linear (i.e., token ring) communication topology. Actually, don't worry about designing the protocol (just give a simple, relatively obvious version). What I want you to concentrate on is what issues / problems arise with this (that is, what are the disadvantages to this approach) that do not arise with the coordinator/broadcast version.
  3. Book: 12.5. Note that it doesn't matter if this is 2-phase commit or 3-phase commit.

It is also worth thinking about 12.6 from the book - having at least thought about it may help in the next phase of the project. You don't need to turn this in, though.

Turning in the assignment

Electronic submission preferred, upload text or PDF (or check with me for other formats) to Blackboard. Hard copy is acceptable as well, please hand in at the beginning of class.

Valid XHTML 1.1!