Seminar on Concurrent Data Structures
CS0368337801
Prof.
Instructions and requirements below after
the schedule.
Spring 2009
The seminar takes place on SUNDAYS at 14:00 Kaploon 319
Date 
Talk 
Presenters 
Materials 
3/15 
Multi core back ground 
Gilad 

3/22 
Mutual Exclusion 
Shiran Mizrachi 

3/29 
Mutual Exclusion, part
II, 
Oded 

4/19 
Linearizability 
Mila 

4/26 
Queue Locks 
Guy 

5/3 
Queue 
Niv, Tal 

5/10 
Link Lists 
Lior 

5/17 
Concurrent Qs, ABA
problem, Stacks, Elimination 
Shiran Haliva, Eran 

5/24 
Dynamic Hash tables 
Tom, Annie 

5/31 
Barrier Synchronization 
Tomer 

6/7 
lexclusion 
Alon 

6/14 



In the first meeting I will provide an overview and
background. In addition I will provide a
list of topics with associated papers that cover the fundamentals of the
seminar subject (at least some of them).
Thereafter, every week, starting in the 4th week, two of the
participating students will present one of these topics (papers) to the
group. The goals are: 1. to study the area, 2. practice in
preparing a presentation and delivering it, 3. bring the students to the front
of the research in this area.
The students leading the discussion in a given week should read
the paper(s) carefully and prepare a presentation discussion on the paper to be
held in the meeting.
Participants are required to:
Your presentation should cover the motivation for the problem as
well as the technical parts of the paper in detail. Assume that the other
participants know nothing about the subject. You are encouraged to deviate from the
logical structure of the paper and present it in the most lucid (clear) way.