CS 425: Lecture Notes
Lecture notes will be made available shortly after each lecture.
Lectures:
Introduction
 
(
per-2 pdf
|
per-6 pdf
)
Basic Message Passing Algorithms
 
(
per-2 pdf
|
per-6 pdf
)
Leader Election
 
(
per-2 pdf
|
per-6 pdf
)
Randomized Leader Election
 
(
per-2 pdf
|
per-6 pdf
)
Minimum spanning tree
 
(
per-2 pdf
|
per-6 pdf
)
and
(
per-2 pdf
|
per-6 pdf
)
Mutual exclusion in shared memory
 
(
per-2 pdf
|
per-6 pdf
)
P2P basics
 
(
per-2 pdf
|
per-6 pdf
)
Freenet and Chord
 
(
per-2 pdf
|
per-6 pdf
)
CAN
(guest lecture by Zheng Ma)  
(
per-2 pdf
|
per-6 pdf
)
Chord/CAN wrapup, Tapestry
 
(
per-2 pdf
|
per-6 pdf
)
Tapestry, Skip graphs
 
(
per-2 pdf
|
per-6 pdf
)
Routing & Inter-domain routing
 
(
per-2 pdf
|
per-6 pdf
)
and
(
per-2 pdf
|
per-6 pdf
)
Ad-hoc routing
 
(
per-2 pdf
|
per-6 pdf
)
Distributed Transactions (guest lectures by Nick Bowen)
 
(
per-2 pdf
|
per-6 pdf
)
Clocks, consistent cuts, snapshots, global predicate evaluation
 
(
per-2 pdf
|
per-6 pdf
)
Consensus, FLP result, Paxos
 
(
per-2 pdf
|
per-6 pdf
)
Secure routing, security
 
(
per-2 pdf
|
per-6 pdf
)
Overlay networks
 
(
per-2 pdf
|
per-6 pdf
)