6.852J / 18.437J Distributed Algorithms, Fall 2001
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 detectio...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Learning Object |
| Language: | en-US |
| Published: |
2001
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/36405 |
| _version_ | 1826214293155086336 |
|---|---|
| author | Lynch, Nancy A. (Nancy Ann), 1948- |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Lynch, Nancy A. (Nancy Ann), 1948- |
| author_sort | Lynch, Nancy A. (Nancy Ann), 1948- |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T16:03:16Z |
| format | Learning Object |
| id | mit-1721.1/36405 |
| institution | Massachusetts Institute of Technology |
| language | en-US |
| last_indexed | 2025-03-10T13:34:27Z |
| publishDate | 2001 |
| record_format | dspace |
| spelling | mit-1721.1/364052025-02-25T16:48:04Z 6.852J / 18.437J Distributed Algorithms, Fall 2001 Distributed Algorithms Lynch, Nancy A. (Nancy Ann), 1948- Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Department of Mathematics 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 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. 2001-12 Learning Object 6.852J-Fall2001 local: 6.852J local: 18.437J local: IMSCP-MD5-176dfcb189c7300b2ded127abc9143a4 http://hdl.handle.net/1721.1/36405 en-US 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. text/html Fall 2001 |
| spellingShingle | 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 Lynch, Nancy A. (Nancy Ann), 1948- 6.852J / 18.437J Distributed Algorithms, Fall 2001 |
| title | 6.852J / 18.437J Distributed Algorithms, Fall 2001 |
| title_full | 6.852J / 18.437J Distributed Algorithms, Fall 2001 |
| title_fullStr | 6.852J / 18.437J Distributed Algorithms, Fall 2001 |
| title_full_unstemmed | 6.852J / 18.437J Distributed Algorithms, Fall 2001 |
| title_short | 6.852J / 18.437J Distributed Algorithms, Fall 2001 |
| title_sort | 6 852j 18 437j distributed algorithms fall 2001 |
| topic | 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 |
| url | http://hdl.handle.net/1721.1/36405 |
| work_keys_str_mv | AT lynchnancyanancyann1948 6852j18437jdistributedalgorithmsfall2001 AT lynchnancyanancyann1948 distributedalgorithms |