Distributed Computing

0368-4429-01

Winter 2007 (2006/2007)

Lecturer: Prof. Yehuda Afek

להלן ציוני בחינה וציונים סופיים:

מספר זיהוי	exam	Final
038269080	100	100
060635521	94.5455	100
038783627	87.2727	99
033655705	90.9091	99
033731795	92.7273	97
066245408	85.4545	97
307131227	87.2727	95
040285504	85.4545	89
039593488	72.7273	88
310725106	70.9091	86
037722956	72.7273	86
309756070	61.8182	82
300471273	67.2727	82
	56.3636	76
039419601	60	75
052986593	43.6364	73
303956130	34.5455	72
040805202	43.6364	72
037336641	36.3636	66

להלן ציוני תרגיל 2:

1	2	3	4	5	6	total	T.Z.
10	10	10	19	23	20	92	038783627
10	10	10	18	25	22	95	038269080
8	10	10	16	21	17	82	066245408
10	10	10	16	16	20	82	060635521
10	10	10	18	20	19	87	033655705
10	9	10	18	22	14	83	033731795
5	10	10	13	17	11	66	307131227
5	10	10	15	17	19	76	039593488
8	1	10	15	10	8	52	309756070
10	5	7	16	22	17	77	310725106
10	10	10	8	15	11	64	052986593
5	7	10	8	16	13	59	037722956
9	4	9	7	10	10	49	300471273
10	10	10	4	18	15	67	040805202
6	2	10	14	12	15	59	040285504
2	10	10	8	10	14	54
10	6	2	5	12	10	45	037336641
5	8	8	4	8	8	41	039419601
10	8	10	14	15	12	69	303956130

להלן ציוני תרגיל 1:

מספר זיהוי	HW1 grade
066245408	90
038783627	90
038269080	84
060635521	84
307131227	79
309756070	77
033655705	77
033731795	64
039593488	61
037722956	58
300471273	57
052986593	55
310725106	51
040285504	44
	42
040805202	37
037336641	36
039419601	31
	0

הבחינה נשלחה אלכם בדוא"ל. הודיעו לי בדוא"ל אם לא קבלתם אותה.

לוח זמנים חדש ! בהמשך הדף (קובץ pdf לא מעודכן). רק הלו"ז בעמוד זה רלונטי.

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

The point distribution for grading the questions of HW1 is as follows:

1.  15%

2. 15%

3. 30% (14, 4, 12)

4. 40% (10, 10, 15, 5)

 The point distribution for grading the questions of HW2 is as follows:

1.  10%

2. 10%

3. 10%

4. 20%

5. 25

6. 25

The answers should be perfect to get all the points. 

The arguments and proofs in 3c, and   4a(2) (The lower bound) should be very strong, precise, and rigorous. 

QA page of HW2

Homework 2 Due April 15 in class.

QA page of HW1

CORRECTED (fixed typos in Q3, the question is correct also in the previous version)

Homework 1 Due March 18 in class.

Winter 2006 Course page

---

Administrative Information

· Lectures: Sunday 17:10-20:00, Schreiber 006

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

Course Topics and Schedule (tentative, subject to change)

DATE	TOPIC
Feb 25	Models, Broadcast & Echo
March 11	Termination Detection, Snapshots, Synchronizers Snapshot paper pdf
March 18	Leader Election, ring networks, unidirectional case
March 18	Leader Election Algorithms and Spanning tree algorithms
March 25	Computing the maximal independent set, rings and general graphs, upper and lower bounds
Done	Data link protocols, the sequence transmition problem and End-to-End protocols and another pdf
STRIKE	STRIKE
May 27	The consensus problem. Algorithms and lower bounds
June 3	The shared memory model, Wait-free synchronization, the shared memory hierarchy and universal constructions.
June 10	The consensus problem, and its impossibility in asynchronous networks with one faulty processor
June 17	Atomic Snapshots of shared memories, Immediate snap-shots,
June 24	Mutual exclusion, Fast Mutual Exclusion, Adaptive Algorithms Taubenfeld Paper Moir Anderson, Lamport-87
Time permitting	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.

---