Assignment 1: Concurrency Control
Start date 23 January, due beginning of class 30 January.
Complete the following exercises:
-
Book: 11.1
-
Book: 11.2
-
Book: 11.4
-
Give a reason why a timestamp ordering based concurrency control
mechanism may be less appropriate for a distributed system than
for a centralized system. You'll want to read at least 11.4.1.
Hint: one reason can be derived from work of my Master's thesis
advisor.
-
Book: 11.13.
(Give a correct non-serializable schedule).
You may want to look into
Semantic Concurrency Control.
-
Bonus: Given the preceding questions, why are serializability enforcing
mechanisms (including ones that do not even allow all serializable schedules,
such as 2PL) used in practice? Hint: You might find clues in reading Section 11.5.
Turning in the assignment
Electronic submission preferred. I'll be setting something up in
a bit (suggestions for your choice welcome - WebCT? Others?)
For this assignment, send to
Pdf is the safest for capturing non-text, please check with me for
formats other than txt or pdf.
Hard copy is acceptable as well, please hand in at the beginning of class.
