Skip to main content

Fundamentals of Distributed Algorithms

Faculty of ScienceComputer Science
Credits3
·
Semester offeredSemester 1 (Fall), Semester 2 (Winter)
·
Last updated3 months ago

Description

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.

Course outline
Checking availability…

Don't see what you need?

Course match finds an equivalent course at another school. Submit a request asks our team to add a missing equivalency.

Preview the 5 closest equivalencies already indexed in our system

COMP575 has possible credit equivalents including COMP90020 at University of Melbourne.

CourseUniversityQwest Score
COMP90020
Distributed Algorithms
University of Melbourne74
COMP5112
Parallel Programming
The Hong Kong University of Science and Technology73
COMP5112
Parallel Programming
The Hong Kong University of Science and Technology73
COMP90020
Distributed Algorithms
University of Melbourne69