Seminar on Concurrent Data Structures
CS0368337801
Prof. Yehuda Afek
Instructions and requirements below after the schedule.
Spring 2008
The seminar takes place on SUNDAYS at 9:00 AM, Schreiber 008
Date 
Talk 
Presenters 
Materials 
5/25 
SpinLocks, (Chapter 7 in The Art of Multiprocessor
Programming, Herlihy & Shavit) 
Eyal Pinkas & Adiel Ebocher 

6/1 
Link Lists (Follow Chapter 9 in the above book) 
Ron Eisenband & Dana Weintraub 

6/15 
Queues and the 
Smadar Carmel & Merav Zanany 

6/22 
Stacks and Elimination technique 
Raviv Marom & Shani Arugi 

6/29 
Combining trees (Chapter 12, 12.1 – 12.3) Counting (12.4 – 12.5) 
Roee Refael & Liran Cohen 
Ppt ppt 
7/06 
Counting (cont. from previous lecture) Diffracting Trees 12.6 
Mor
Gazith 

7/13 
Concurrent Hashing and new Article by Moran Safrir and Nir Shavit. 


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.