BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Highly-Efficient Concurrent Data Structures
DTSTART:20140407T110000
DTEND:20140407T120000
DTSTAMP:20260411T101747Z
UID:dc382c1a84106fbb1b86eac2101f3fca0245b48848cb6b642bc375ed
CATEGORIES:Conferences - Seminars
DESCRIPTION:Panagiota Fatourou\nPanagiota Fatourou is an Assistant Profess
 or at the Department of Computer Science\, University of Crete\, Greece an
 d an affiliated faculty member of the Institute of Computer Science (ICS) 
 of the Foundation for Research and Technology - Hellas (FORTH). Prior to j
 oining the University of Crete and FORTH ICS\, she was a full-time faculty
  member at the Department of Computer Science of the University of Ioannin
 a\, Greece. The academic years 1999-2000 and 2000-2001\, she was a postdoc
  at Max-Planck Institut für Informatik\, Saarbrücken\, Germany\, and at 
 the Computer Science Department of the University of Toronto\, Canada. She
  got a degree in Computer Science from the University of Crete\, and a PhD
  degree in Computer Engineering from the University of Patras. Her researc
 h interests focus on the theory of parallel and distributed computing.\nAb
 stract\nWe present highly-efficient synchronization techniques for asynchr
 onous shared memory settings showing that they outperform all state-of-the
 -art lock-based and lock-free synchronization algorithms. We use these tec
 hniques to get efficient implementations of simple data structures\, like 
 stacks and queues.\nWe also present an implementation of a non-blocking bi
 nary search tree using single-word compare-and-swap operations. Insert and
  Delete operations that modify different parts of the tree do not interfer
 e with one another\, so they can run completely concurrently. Find operati
 ons only perform reads of shared memory. We provide an analysis to bound t
 he worst-case amortized step complexity of performing a Find\, Insert or D
 elete operation on this tree. 
LOCATION:BC 329 https://plan.epfl.ch/?room==BC%20329
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR