6.852[J] 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[J] will not be offered this semester. It will be instructed by N. A. Lynch.
This class counts for a total of 12 credits. This is a graduate-level class.
You can find more information at the MIT + 6.852 - Google Search site.
© Copyright 2015 Yasyf Mohamedali