BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Asynchronized Concurrency: The Secret to Scaling Concurrent Search
  Data Structures - Vasileios Trigonakis\, EPFL\, Switzerland
DTSTART:20150619T120000Z
DTEND:20150619T130000Z
UID:TALK59889@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:In this talk\, I will first present "asynchronized concurrency
  (ASCY)\," a paradigm consisting of four complementary programming pattern
 s. ASCY calls for the design of concurrent search data structures to resem
 ble that of their sequential counterparts. I will show how ASCY leads to i
 mplementations which are portably scalable: they scale across different ty
 pes of hardware platforms\, including single and multi-socket ones\, for v
 arious classes of workloads\, and according to different performance metri
 cs\, including throughput\, latency\, and energy. \n\nI will then introduc
 e our ongoing work on OPTIK\, a concurrency framework that facilitates the
  design and implementation of ASCY-compliant data structures. OPTIK relies
  on the well-explored ideas of versioning and validation: a thread acquire
 s a version number\, optimistically accesses the data structure\, and then
  locks and validates the version to detect concurrency. I will show how OP
 TIK can be used to easily make lock-based data structures more optimistic 
 and more scalable.\n\n(Asynchronized concurrency appeared in ASPLOS '15)
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR