Note: This is the 2012–2013 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.
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: This course is not scheduled for the 2012-2013 academic year.
Instructors: There are no professors associated with this course for the 2012-2013 academic year.
3 hours
Prerequisite: COMP 310