6.852J | Fall 2009 | Graduate

Distributed Algorithms

Lecture Notes

Class 24

Description:

Lecture presentation on self-stabilization, self-stabilizing algorithms, breadth-first spanning trees, mutual exclusion, composing self-stabilizing algorithms, and making non-self-stabilizing algorithms self-stabilizing.

Resource Type:
Lecture Notes

Course Info

Instructor
As Taught In
Fall 2009
Level
Learning Resource Types
Problem Sets
Lecture Notes