Distributed Computing

0368-4429-01

Spring-Summer 2008 (2007/2008)

Lecturer: Prof. Yehuda Afek

Below are the exam and final grades:

ID Last 4 digits	Exam	Exam Factor	Final Grade
7189	95	100	100
5957	90	96	100
8915	85	92	98
8797	92	98	97
8701	87	94	95
6468	90	96	95
9100	92	98	94
2699	90	96	94
7667	91	97	93
4070	86	93	93
6953	85	92	92
6762	81	89	91
8465	81	89	90
7462	88	95	90
5083	79	88	90
3978	86	93	90
4349	80	88	89
8945	75	84	87
8711	71	81	87
7277	80	88	87
5858	76	85	87
4772	77	86	87
2741	77	86	87
3523	79	88	86
3743	71	81	85
7520	73	83	84
5857	72	82	84
1339	75	84	84
2353	70	80	83
9094	65	76	82
3245	68	79	82
4451	66	77	81
7838	70	80	80
3420	69	80	78
3724	66	77	77
4550	61	73	76
9564	56	69	75
9837	56	69	71
3751	56	69	71
6510	72	82	68
5111	47	62	67
6436	71	81	65
8299	46	61	60
1277		N/A	N/A
4511	32	50	46

Take home exam QA

I have sent the following email to all on Friday July 18, 2008:

-------------------------------------------------------------------------------

Shalom le Kulam,

Each of you have another 2 days to submit the exam to Larisa. 

That is, the standard deadline is now Tuesday July 22nd, before Larisa goes home.

If you got x days above the deadline then you have x days after Tuesday July 22nd.

Please check the QA page at http://www.cs.tau.ac.il/~afek/qa08ex.html

Good luck and Shabat Shalom,

Yehuda

------------------------------------------------------------------------------------------------------
Take home exam was sent by email. Due July 20.

Q1=10%, Q2=20%, Q3=25%, Q4=15%, Q5 = 20%, Q6=10%.

Homework3 due July 13.

Nir’s lecture

*** ROOM change: we have moved to Holzblat 007 !!!

*** לתשומת לבכם, השנה מתקיים סמינר מתקדם בסינכרון וזכרון משותף

---

Administrative Information

· Lectures: Sunday 17:10-20:00, Holsblat 007

· Office Hours, by appointment (email) Sunday 15:00-16:00

Course Topics and Schedule (tentative, subject to change)

DATE	TOPIC
May 4	Models, Broadcast & Echo
May 11	Termination Detection, Snapshots, Synchronizers Snapshot paper pdf
May 18	Leader Election, ring networks, unidirectional case
May 25	Leader Election Algorithms and Spanning tree algorithms
June 1	Computing the maximal independent set, rings and general graphs, upper and lower bounds
June 8	*** Shavuot holiday ***
June 15	Data link protocols, the sequence transmition problem and End-to-End protocols and another pdf
June 22	The consensus problem. Algorithms and lower bounds
Was on May 18 (Nir Shavit)	The shared memory model, Wait-free synchronization, the shared memory hierarchy and universal constructions. Atomic Snapshots of shared memories, Immediate snap-shots,
June 29	The consensus problem, and its impossibility in asynchronous networks with one faulty processor
July 6	Mutual exclusion, Fast Mutual Exclusion, Adaptive Algorithms Taubenfeld Paper Moir Anderson, Lamport-87
July 13	Simulating Shared memory in message passing, Randomized Consensus.
Time permitting	Lower bound techniques (log ^* n for maximal independent set on ring of size n).
Time permitting	Renaming, Eventually connected end-to-end STP, Concurrent Time Stamps,

See OLD (!!!!) Course outline (NOT up to date) with references (pdf)

---

Grade

The grade weighting for the semester will be:

Home Works	35%
Take home exam:	65%

These weights are subject to change.

---

Winter 2007 Course page

Winter 2006 Course page