|
|
Distributed Computing
0368-4429-01
Winter 2024 – 25 תשפ"ה
Checkpoint 002
DATE 2024 |
TOPIC |
November 5 |
Introduction, Models, Broadcast and Echo |
November 12 |
Termination Detection, Snapshots, Synchronizers,
Snapshot paper pdf Leader Election, ring
networks, lower
bound |
November 19 |
Leader Election Algorithms and Spanning tree
algorithms (general topology networks) |
November 26 |
The consensus problem.
Berman Garay phase king protocol, Algorithms
and lower bounds, f<n/4 and f<n/3 in 2f and 3f rounds |
December 3 |
Impossibility of Consensus in shared memory 2 processors
1 fault. Impossibility n processors 1 fault
(BG simulation). |
December 10 |
Waitfree.
The shared memory hierarchy and universal constructions. Common2.
Level 1? Atomic Snapshots of shared memories, Immediate snap-shots, |
December 17 |
Consensus in Asynchronous message passing. Simulating Shared memory in message
passing, Randomized Consensus. |
December 24 |
Consensus in Asynchronous message passing. Simulating Shared memory in message
passing, Randomized Consensus. |
December 31 |
CyberSecurity lecture |
January 7 |
Paxos, Raft, State Machine replication |
January 14 |
Bitcoin protocol, Satoshi Nakamoto |
January 21 |
Algorand protocol, Proof of Stake, Proof of Space |
January 28 |
From Paxos to
Byzantine SMR* to Blockchains (*State Machine Replication) |
January 31 |
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