6.852 Distributed Algorithms
Design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks. Process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation.
This class has 6.046 as a prerequisite.
6.852 will not be offered this semester. It will be available in the Fall semester, and will be instructed by N. A. Lynch.
Lecture occurs 11:00 AM to 12:30 PM on Tuesdays and Thursdays in 32-141.
This class counts for a total of 12 credits.
© Copyright 2015 Yasyf Mohamedali