Assignment handed out on Monday, March 5, 2001

Due in Recitation on 3/6/2001:

• Read Eraser: A Dynamic Data Race Detector for Multi-Threaded Programs. For recitation, come prepared with a 5 minute summary of the paper (i.e., what problem is being solved, what approach is being used, ...)
• Read End to End Arguments in System Design. For recitation, come prepared with a 5 minute summary of the paper (i.e., what problem is being solved, what approach is being used, ...)
• Read Grapevine: An Exercise in Distributed Computing. Your writing/discussion assignment:

  In Grapevine, name resolution is designed so that reads are much more performant than updates. Describe a worst-case scenario which induces the client to perform the full resource location algorithm. Make sure you describe the resource location algorithm in your response.