6.852: Distributed Algorithms
Fall, 2009
Class 3
Todays plan
Algorithms in general synchronous networks (continued):
Shortest paths spanning tree
Minimum-weight spanning tree
Maximal independent set
Reading: Sections 4.3-4.5
Next:
Distributed consens
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 17
Thursday, December 3, 2009
Problem Set 7
Due: Thursday, December 10, 2009
Reading:
Borowsky, Gafni, Lynch, Rajsbaum paper.
Attiya, Welch, Section 5.3.2 (optio
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 11
October 22, 2009
Problem Set 4, Part a
Due: Thursday, November 5, 2009
Reading:
Chapter 18, Lamports Time, Clocks,. paper, Mattern paper, Chapter 19.
Reading
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 16
Tuesday, November 24, 2009
Problem Set 6, Part b
Due: Thursday, December 3, 2009
Reading:
Herlihy paper on wait-free synchronization.
(Optional) Attiya, Welch
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 9
October 8, 2009
Problem Set 3, Part a
Due: Thursday, October 22, 2009
Reading:
Section 8.5. Chapter 14 (skim). Chapter 15.
Reading for next week: Chapter 16.
C
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 6
September 24, 2009
Problem Set 2, Part a
Due: Thursday, October 8, 2009
Reading:
Section 5.1, Chapter 6 of Distributed Algorithms
Aguilera, Toueg paper, listed
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 17
Thursday, November 19, 2009
Problem Set 6, Part a
Due: Thursday, December 3, 2009
Reading:
Chapters 9 and 18 from the Herlihy, Shavit book. (See course web si
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 5
September 17, 2009
Problem Set 1, Part b
Due: Thursday, September 24, 2009
Reading:
Sections 3.6, 4.1-4.5 of Distributed Algorithms
Reading for next week: Sect
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 13
November 5, 2009
Problem Set 5, Part a
Due: Thursday, November 19, 2009
Reading:
Herlihy-Shavit book, Chapter 7;
Mellor-Crummey and Scott paper;
Magnussen, La
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 14
November 12, 2009
Problem Set 5, Part b
Due: Thursday, November 19, 2009
Reading:
Chapter 13.
Note:
Because of travel schedules, we are reordering some of the
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 10
October 15, 2009
Problem Set 3, Part b
Due: Thursday, October 22, 2008
Reading:
Chapter 16.
Reading for next week:
Chapter 18, Lamports Time, Clocks,. paper.
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 7
October 1, 2009
Problem Set 2, Part b
Due: Thursday, October 8, 2009
Problem sets will be collected in class.
Reading:
Aguilera, Toueg paper
(Optional) Keidar,
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 12
October 29, 2009
Problem Set 4, Part b
Due: Thursday, November 5, 2009
Reading:
Chapter 9 (skim); Sections 10.1-10.8 in detail, 10.9 (skim)
Reading for next w
6.852: Distributed Algorithms
Fall, 2009
Class 2
Todays plan
Leader election in a synchronous ring:
Lower bound for comparison-based algorithms.
Basic computation in general synchronous networks:
Leader election
Breadth-first search
Broadcast and co
6.852: Distributed Algorithms
Fall, 2009
Instructor: Nancy Lynch
Guest Instructor: Victor Luchangco
Distributed algorithms
Algorithms that are supposed to work in distributed
networks, or on multiprocessors.
Accomplish tasks like:
Communication
Data man
6.852: Distributed Algorithms
Fall, 2009
Class 4
Todays plan
Fault-tolerant consensus in synchronous systems
Link failures:
The Two Generals problem
Process failures:
Stopping and Byzantine failure models
Algorithms for agreement with stopping and B
Massachusetts Institute of Technology
6.852: Distributed Algorithms
Prof. Nancy Lynch
Handout 4
September 10, 2009
Problem Set 1, Part a
Due: Thursday, September 24, 2009
Problem sets will be collected in class. Please hand in each problem on a separate p