6.852J / 18.437J Distributed Algorithms, Fall 2001
dc.contributor.author | Lynch, Nancy A. (Nancy Ann), 1948- | en_US |
dc.coverage.temporal | Fall 2001 | en_US |
dc.date.issued | 2001-12 | |
dc.identifier | 6.852J-Fall2001 | |
dc.identifier | local: 6.852J | |
dc.identifier | local: 18.437J | |
dc.identifier | local: IMSCP-MD5-176dfcb189c7300b2ded127abc9143a4 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/36405 | |
dc.description.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. | en_US |
dc.language | en-US | en_US |
dc.rights.uri | 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. | en_US |
dc.subject | distributed algorithms | en_US |
dc.subject | algorithm | en_US |
dc.subject | concurrent algorithms | en_US |
dc.subject | distributed networks | en_US |
dc.subject | process synchronization | en_US |
dc.subject | computational resources | en_US |
dc.subject | distributed consensus | en_US |
dc.subject | distributed graph algorithms | en_US |
dc.subject | distributed termination | en_US |
dc.subject | deadlock detection | en_US |
dc.subject | concurrency control | en_US |
dc.subject | communication | en_US |
dc.subject | clock synchronization | en_US |
dc.subject | fault tolerance | en_US |
dc.subject | distributed computation | en_US |
dc.subject | 6.852J | en_US |
dc.subject | 18.437J | en_US |
dc.subject | 6.852 | en_US |
dc.subject | 18.437 | en_US |
dc.subject | Electronic data processing -- Distributed processing. | en_US |
dc.subject | Algorithms | en_US |
dc.title | 6.852J / 18.437J Distributed Algorithms, Fall 2001 | en_US |
dc.title.alternative | Distributed Algorithms | en_US |
Files in this item
This item appears in the following Collection(s)
-
Electrical Engineering and Computer Science (6) -
Electrical Engineering and Computer Science (6) -
Mathematics (18) - Archived
Mathematics (18)