Keynote Talk: Optimistic and pessimistic synchronization for data structures for in-memory stores
Brandeis University (USA)
Liuba Shrira is a Professor in the Computer Science Department at Brandeis University, and is affiliated with the Computer Science and Artificial Intelligence Laboratory at MIT. She received her PhD from Technion (Israel) what feels like yesterday, working on theoretical aspects of distributed algorithms. From 1986 to 1997 she was a researcher in the MIT Programming Methodology Group. She joined Brandeis in 1997. In 2004-2005 she was a visiting researcher at Microsoft Research, Cambridge, UK. In 2010-2011 she was a visiting researcher at Microsoft Research Asia, and a visiting Professor in the Computer Science Department, Technion.
Her research interests span aspects of design and implementation of distributed systems and especially data stores. This includes fault-tolerance, availability and performance issues. Her recent focus is on long-lived transactional storage, time travel (in storage), software upgrades, byzantine faults, and support for highly concurrent multicore stores.
Liuba Shrira is a member of ACM and has been recognized as a Distinguished Scientist by ACM for « significant accomplishments in, and impact on, the computing field ».
“Dumb code and clever data structures works better than the other way around”.
A concurrent system’s performance can often be improved if we understand the semantics of its data types. Type-specific concurrency control is particularly helpful in in-memory transactional stores where the penalty of false conflicts can be high. The talk will focus on techniques that exploit type-specific knowledge to avoid false conflicts under both optimistic and pessimistic concurrency control schemes and present new approaches that allow to combine the benefits of both.
February 23, 2019
Abstract submission deadline
March 02, 2019
Paper submission deadline
April 27, 2019
May 11, 2019
Camera ready copy due
Revised selected papers will be published as a post-proceedings in Springer's LNCS "Lecture Notes in Computer Science"
Partners & Sponsors (Pending)