Distributed Computing


Spring-Summer 2012

Lecturer: Prof. Yehuda Afek


Pre Exam Questions

Homework #3 Due: June 3

Template file for grading

Homework #1 Due: March 18

Homework #2 Due: April 22

Limor's class notes (from 2008/9). Week 1-7, week 8-13.

Administrative Information

       Lectures: Sunday 17:10-20:00, Shenkar 222

       Office Hours, by appointment (email)

Course Topics and Schedule (Tentative, subject to change !! )



March 4

Models, and Introduction.

March 11

Broadcast and Echo Termination Detection, Snapshots, Synchronizers Snapshot paper pdf

March 18

Leader Election, ring networks, unidirectional case

March 25

Leader Election Algorithms and Spanning tree algorithms

April 1

Computing the maximal independent set, rings and general graphs, upper and lower bounds

April 15

Data link protocols, the sequence transmition problem and

End-to-End protocols and another pdf

April 22

The consensus problem. Algorithms and lower bounds

April 29

The shared memory model, Wait-free synchronization, the shared memory hierarchy and universal constructions. Atomic Snapshots of shared memories, Immediate snap-shots,

May 6

The consensus problem, and its impossibility in asynchronous networks with one faulty processor

May 13

Mutual exclusion, Fast Mutual Exclusion, Adaptive Algorithms Taubenfeld Paper

Moir Anderson, Lamport-87

May 20

Simulating Shared memory in message passing, Randomized Consensus.

May 29

Lower bound techniques (log * n for maximal independent set on ring of size n).

June 3

Renaming, Eventually connected end-to-end STP, Concurrent Time Stamps,

June 10

Concurrent programming, the link list case

June 17

More on concurrent programming


See Course outline with references (pdf





The grade weighting for the semester will be:

Home Works 


Take home exam: 


These weights are subject to change.










Winter 2011 Course page

Winter 2010 Course page

Winter 2009 Course page

Winter 2008 Course page

Winter 2007 Course page

Winter 2006 Course page