COMP 575 Fundamentals of Distributed Algorithms (3 credits)

Offered by: Computer Science (Faculty of Science)

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 2017-2018 academic year.

Instructors: There are no professors associated with this course for the 2017-2018 academic year.