6.852J / 18.437J Distributed Algorithms, Fall 2001

Lynch, Nancy A. (Nancy Ann), 1948-

Author(s)

Lynch, Nancy A. (Nancy Ann), 1948-

Download6-852JFall-2001/OcwWeb/Electrical-Engineering-and-Computer-Science/6-852JDistributed-AlgorithmsFall2001/CourseHome/index.htm (15.81Kb)

Alternative title

Distributed Algorithms

Terms of use

Usage Restrictions: This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions.

Metadata

Show full item record

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. Alternate years. From the course home page: 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.

Date issued

2001-12

URI

http://hdl.handle.net/1721.1/36405

Department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics

Other identifiers

6.852J-Fall2001

local: 6.852J

local: 18.437J

local: IMSCP-MD5-176dfcb189c7300b2ded127abc9143a4

Keywords

distributed algorithms, algorithm, concurrent algorithms, distributed networks, process synchronization, computational resources, distributed consensus, distributed graph algorithms, distributed termination, deadlock detection, concurrency control, communication, clock synchronization, fault tolerance, distributed computation, 6.852J, 18.437J, 6.852, 18.437, Electronic data processing -- Distributed processing., Algorithms

Collections

MIT OCW Archived Courses