Distributed Algorithms, Fall 2001

View Resource

Remix and Share

Author:

Lynch, Nancy

Subject:

Science and Technology

Institution Name:

M.I.T.

Collection:

MIT OpenCourseWare

Grade Level:

Post-secondary

Abstract:

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. Course Description 6.852J / 18.437J intends to: (1) provide a rigorous introduction to the most important research results in the area of distributed algorithms, and (2) prepare interested students to carry out independent research in distributed algorithms. Topics covered include: 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 is given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation are also discussed.

Languages:

English

Material Type:

Activities and Labs, Full Course, Homework and Assignments, Lecture Notes, Syllabi

Media Format:

Text/HTML, Downloadable docs

Conditions of Use:

Creative Commons Attribution-Noncommercial-Share Alike 2.5