http://www.cs.tau.ac.il/images/school-title.jpg

 

       Distributed Computing

       0368-4429-01

         Spring-Summer 2014

         Lecturer: Prof. Yehuda Afek

Grades:

ID

HW #1

HW #2 & #3
Out of 150

HW #4

hws

Exam

Final

026592147

50

130

93

79.1

72

80

035677863

78

120

90

82.0

60

78

038781100

85

135

97

90.5

85

92

040833519

83

135

100

90.8

75

86

200507879

70

110

80

74.2

97

95

200823078

75

105

95

77.5

xx

203787924

100

141

100

97.0

90

100

300066305

97

140

97

95.2

85

94

300370129

80

140

82

87.2

99

100

301659835

68

145

97

89.6

90

97

307751453

100

142

100

97.3

80

92

308454800

70

125

100

84.2

75

94

310586813

90

131

62

81.7

83

93

312860547

67

125

97

82.7

79

86

 

Ants algorithms presentation by Moshe

Exam 2013

Homework 5 due June 16 (no need to submit).

Solutions hw1

Solutions hw2-3

 

Notice updates in the schedule below.

Homework 4 due May 18.

Homework 1 due March 30th.

Homeworks 2 & 3 due April 27th.

Grades HW1 and HW2&3

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, Multi-Disciplinary Center 315

       Office Hours, by appointment (email)

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

DATE

TOPIC

February 16

Models, and Introduction.

February 23

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

March 2

** Moshe Sulamy lecture ** Leader Election, ring networks, unidirectional case

March 9

Leader Election Algorithms and Spanning tree algorithms (general topology networks)

March 16

*** PURIM ***

March 23

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

March 30

Data link protocols, the sequence transmition problem and

End-to-End protocols and another pdf

April 6

The consensus problem. Algorithms and lower bounds

April 27

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

May 4

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

May 11

Mutual exclusion, Fast Mutual Exclusion, Adaptive Algorithms Taubenfeld Paper

Moir Anderson, Lamport-87

May 18

Simulating Shared memory in message passing, Randomized Consensus.

May 25

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

June 1

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

June 8

Moshe Sulamy lecture: Biological Distributed Algorithms ANTS (new !! and part of the material for the exam!!)

Time permitting

Concurrent programming, the link list case

 


 

 

 

 

 

 

 

 

 

 

 

 

Grade

The grade weighting for the semester will be:

Home Works 

35%

Take home exam: 

65%

These weights are subject to change.


 

 

 

 

 

 

 

 

 

 

 

 

Winter 2013 Course page