|
Home
| Subject Search
| Help
| Symbols Help
| Pre-Reg Help
| Final Exam Schedule
| My Selections
|
Searched for: "18.437" Subjects offered any term 1 subject found.
18.437[J] Distributed Algorithms
(
)
(Same subject as 6.852[J])
Prereq: 6.046
Units: 3-0-9
Lecture: TR11-12.30 (32-141)
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.
N. Lynch
Textbooks (Fall 2018)
| ||||||||
