Engineering and Applied Sciences >> Computer Science

For Course Instructors

  • Advertise your course for free
  • Feature your course listing
  • Create course discussion group
  • Link to your course page
  • Increase student enrollment

More Info...>>

Course Info

  • Course Number / Code:
  • 18.437J (Fall 2005) 
  • Course Title:
  • Distributed Algorithms 
  • Course Level:
  • Graduate 
  • Offered by :
  • Massachusetts Institute of Technology (MIT)
    Massachusetts, United States  
  • Department:
  • Electrical Engineering and Computer Science 
  • Course Instructor(s):
  • Prof. Nancy Lynch 
  • Course Introduction:

  • 6.852J / 18.437J Distributed Algorithms

    Fall 2005

    Course Highlights

    This course features a complete bibliography of readings and, in the assignments section, all problem sets.

    Course Description

    This course intends to provide a rigorous introduction to the most important research results in the area of distributed algorithms, and 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.

    Detailed information on the course textbook can be found here:

    Lynch, Nancy A. Distributed Algorithms. San Francisco, CA: Morgan Kaufmann, 1997. ISBN: 1558603484.


This course content is a redistribution of MIT Open Courses. Access to the course materials is free to all users.

© 2009-2020, All Rights Reserved.
Higher Ed Space ® is a registered trademark of AmeriCareers LLC.