|
|
|
|
Distributed
Computing 0368-4429-01 Spring-Summer 2019 Lecturer: Prof. Yehuda Afek |
|
Grades:
|
final |
|
|
0058 |
94.00 |
|
80530 |
99.00 |
|
48006 |
99.00 |
|
69677 |
92.00 |
|
51401 |
98.00 |
|
68784 |
97.00 |
|
0889 |
83.00 |
|
16515 |
80.00 |
|
37653 |
98.00 |
|
24121 |
|
|
7968 |
89.00 |
|
89725 |
91.00 |
|
8499 |
|
|
4690 |
89.00 |
|
8604 |
|
|
6870 |
99.00 |
|
31860 |
100.00 |
|
6645 |
98.00 |
|
3061 |
89.00 |
|
6858 |
73.00 |
|
5004 |
93.00 |
|
8720 |
83.00 |
|
3427 |
91.00 |
|
9518 |
95.00 |
|
4063 |
99.00 |
|
2506 |
88.00 |
|
7371 |
84.00 |
|
1304 |
100.00 |
|
9191 |
80.00 |
|
1857 |
97.00 |
Homework 4 Due on June 17
מצגות
מטבעות
דיגיטליים
ועוד חומרים
מצגת raft
מאמר
הארץ על
פרטיות
שהזכרתי
בכיתה המאמר
המקורי
מהניו-יורק
טיימס
מצגת
פקסוס
Homework 3 Due on April 28, 9PM !
Draft projects list
Presentation from April
14 class
Homework 2 Due on April 9, 9PM !
Homework 1 is on. Due on March 21st.
Bakery Code for HW1
First lecture slides
Eli Daian class notes
Limor's class notes (from 2008/9). Week 1-7, week 8-13.
(in some of the weeks we will study
different material than in Limor's notes)
Administrative Information
· Lectures: Sunday 16:10-19:00,
Schreiber 007
· Office Hours, by appointment
(email me)
Course Topics and Schedule (Tentative,
subject to change !! )
|
DATE |
TOPIC |
|
March 3 Adam Morrison |
Models,
Introduction, Shared memory Mutual Exclusion. |
|
March 10 |
Broadcast
and Echo Termination Detection, Snapshots, Synchronizers,
Snapshot paper pdf Leader Election, ring
networks, lower
bound |
|
March 17 |
Leader Election Algorithms and Spanning tree algorithms
(general topology networks) |
|
March 24 |
The
consensus problem. Berman Garay phase king protocol, Algorithms and lower bounds,
f<n/4 and f<n/3 in 2f and 3f rounds |
|
March 31 |
Impossibility of
Consensus in shared memory 2 processors 1 fault. Impossibility n processors 1 fault (BG simulation). |
|
April 7 |
Waitfree.
The shared memory hierarchy and universal constructions. Common2.
Level 1? Atomic Snapshots of shared memories, Immediate snap-shots, |
|
April 14 |
The consensus problem, and its
impossibility in asynchronous networks with one faulty processor. Simulating
Shared memory in message passing, Randomized Consensus. |
|
** Pesah ** |
|
|
April 28 |
|
|
May 5 |
Fault
tolerant Byzantine Agreement, Miguel Castro, Barbara Liskov,
OSDI 1999 |
|
May 12 |
Paxos, Raft, State Machine replication |
|
May 19 |
Bitcoin protocol, Satoshi Nakamoto |
|
May 26
**Prof. Ittai Abraham@VMWare |
From Paxos to Byzantine SMR* to Blockchains
(*State Machine Replication) |
|
June 2 |
Overview,
Discussion of projects, Homeworks, Blockchain applications, Game Theory (hw3), log*n upper
and lower bound for maximal independent set. |
|
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% |
|
Class participation: |
5% |
These weights are subject to change.