Overview
Computer Science (Sci) : Study of a collection of algorithms that are basic to the world of concurrent programming. Discussion of algorithms from the following areas: termination detection, deadlock detection, global snapshots, clock synchronization, fault tolerance (byzantine and self-stabilizing systems). Students will implement algorithms on the BBN butterfly and will present papers on topics in these areas.
Terms: Fall 2009
Instructors: Tropper, Carl (Fall)
- 3 hours
- Prerequisite: COMP 310