|
|
|
Distributed
Computing
0368-4429-01
October 2025 – January 2026 תשפ"ו
Checkpoint 002
|
DATE 2025/2026 |
TOPIC |
|
October 28 |
Introduction, Models, Broadcast and Echo |
|
November 4 |
Termination Detection, Snapshots, Synchronizers,
Snapshot paper pdf Leader Election, ring
networks, lower
bound |
|
November 11 |
Leader Election Algorithms and Spanning tree algorithms
(general topology networks) |
|
November 18 |
The consensus problem. Berman Garay
phase king protocol, Algorithms and lower bounds, f<n/4 and f<n/3 in 2f
and 3f rounds |
|
November 25 |
Impossibility of Consensus in shared memory 2 processors
1 fault. Impossibility n processors 1 fault
(BG simulation). |
|
December 2 |
Waitfree.
The shared memory hierarchy and universal constructions. Common2.
Level 1? Atomic Snapshots of shared memories, Immediate snap-shots, |
|
December 9 |
Consensus in Asynchronous message passing. Simulating Shared memory in message
passing, Randomized Consensus. |
|
December 16 |
Consensus in Asynchronous message passing. Simulating Shared memory in message
passing, Randomized Consensus. |
|
December 23 |
CyberSecurity lecture |
|
December 30 |
Paxos, Raft, State Machine replication |
|
January 6 |
Bitcoin protocol, Satoshi Nakamoto |
|
January 13 |
Algorand protocol, Proof of Stake, Proof of Space |
|
January 20 |
From Paxos to
Byzantine SMR* to Blockchains (*State Machine Replication) |
|
Time permitting |
Fault tolerant Byzantine Agreement, Miguel
Castro, Barbara Liskov, OSDI 1999 |
|
Time permitting |
Proof of Space/Time blockchain |
|
Time permitting |
Computing the maximal independent set, rings and
general graphs, upper and lower bounds |
|
|
|
Grade
The grade weighting for the semester will be:
|
Home Works: |
40% |
|
Final Project: |
55% (10% - writing and
presentation, 90% creativity, innovation and
technical depth) |
|
Class participation: |
5% In person or Zoom |
These weights are subject to change.
עמוד הקורס משנה שעברה 2022-23