6.852J / 18.437J Distributed Algorithms, Fall 2005
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, emph...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Learning Object |
| Language: | en-US |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/60694 |
| _version_ | 1826191120091054080 |
|---|---|
| author | Lynch, Nancy |
| 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 |
| author_sort | Lynch, Nancy |
| collection | MIT |
| 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. |
| first_indexed | 2024-09-23T08:50:48Z |
| format | Learning Object |
| id | mit-1721.1/60694 |
| institution | Massachusetts Institute of Technology |
| language | en-US |
| last_indexed | 2025-03-10T07:26:08Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | mit-1721.1/606942025-02-25T16:48:01Z 6.852J / 18.437J Distributed Algorithms, Fall 2005 Distributed Algorithms Lynch, Nancy 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 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 algorithm 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 Electronic data processing -- Distributed processing. Algorithms 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. 2005-12 Learning Object 6.852J-Fall2005 local: 6.852J local: 18.437J local: IMSCP-MD5-5e35f7cc76e41c12691bdb573daaac29 http://hdl.handle.net/1721.1/60694 en-US Usage Restrictions: This site (c) Massachusetts Institute of Technology 2010. 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") unless otherwise noted. 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 2005 |
| 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 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 algorithm 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 Electronic data processing -- Distributed processing. Algorithms Lynch, Nancy 6.852J / 18.437J Distributed Algorithms, Fall 2005 |
| title | 6.852J / 18.437J Distributed Algorithms, Fall 2005 |
| title_full | 6.852J / 18.437J Distributed Algorithms, Fall 2005 |
| title_fullStr | 6.852J / 18.437J Distributed Algorithms, Fall 2005 |
| title_full_unstemmed | 6.852J / 18.437J Distributed Algorithms, Fall 2005 |
| title_short | 6.852J / 18.437J Distributed Algorithms, Fall 2005 |
| title_sort | 6 852j 18 437j distributed algorithms fall 2005 |
| 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 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 algorithm 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 Electronic data processing -- Distributed processing. Algorithms |
| url | http://hdl.handle.net/1721.1/60694 |
| work_keys_str_mv | AT lynchnancy 6852j18437jdistributedalgorithmsfall2005 AT lynchnancy distributedalgorithms |