6.852J | Fall 2009 | Graduate

Distributed Algorithms

Lecture Notes

Class 19

Description:

Lecture presentation on techniques for implementing concurrent objects, coarse-grained mutual exclusion, fine-grained locking (mutex and read/write), optimistic locking, lock-free/nonblocking algorithms, “lazy” synchronization, and list-based sets.

Resource Type:
Lecture Notes

Course Info

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