BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Fast and Robust Memory Reclamation for Concurrent Data Structures
DTSTART:20160607T140000
DTEND:20160607T160000
DTSTAMP:20260406T214532Z
UID:6742d439be5c14c408933da5d053bd911523ffee193f9cfdee2dfcd8
CATEGORIES:Conferences - Seminars
DESCRIPTION:Mihail Igor Zablotchi\nEDIC Candidacy Exam\nExam President: Pr
 of. Willy Zwaenepoel\nThesis Director: Prof. Rachid Guerraoui\nCo-examiner
 : Prof. Christos Kozyrakis\nBackground papers:Hazard Pointers: Safe Memory
  Reclamation for Lock-Free Objects (2004) by M. Michael.Performance of mem
 ory reclamation for lockless synchronization (2007) by T. E. Hart\, P. E. 
 McKenney\, A. D. Brown and J. Walpole.Fence-Free Work Stealing on Bounded 
 TSO Processors(2014) by A. Morrison and Y. Afek.Abstact\nEfficiently reusi
 ng memory is essential for applications whose data structures grow and shr
 ink dynamically. In a concurrent setting without automatic garbage collect
 ion\, determining when it is safe to reuse memory is a challenge\, especia
 lly for lock-free data structures. Existing practical solutions are either
  robust but slow or fast but vulnerable to thread delays.\nIn this proposa
 l\, we discuss three existing works and how they relate to our research. F
 irst\, we examine hazard pointers\, a well-established wait-free solution 
 to the memory reclamation problem. Second\, we consider a comparative perf
 ormance study showing that practical implementations of hazard pointers ar
 e slowed down by seemingly necessary memory barriers and that blocking sol
 utions are faster. Third\, we analyze a paper eliminating memory barriers 
 from another type of algorithm\, a work stealing queue\, by relying on the
  behavior of hardware store buffers. Finally\, we show how these works hav
 e inspired us to achieve memory barrier elision for hazard pointers and th
 en combine these barrier-free hazard pointers with a blocking solution in 
 a hybrid technique that is at the same time fast and robust.
LOCATION:INN 326 http://plan.epfl.ch/?request_locale=en&room=inn+326&domai
 n=places
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR