Title: Lock-free Data Sharing in Concurrent Software Systems
Speaker: Philippas Tsigas, Chalmers University of Technology
Abstract: Concurrent data structures provide the means to multi-threaded applications to share data. Typical designs of concurrent data structures are based on locks in order to avoid inconsistency due to concurrent modifications. Locks though introduce a sequential component in Amdahl’s law. Lock-free algorithmic designs of concurrent data structures were introduced in the quest for better performance and scalability and are widely used in practice. Lock-free designs typically employ optimistic conflict control making performance analysis challenging.
In this talk, I will describe recent efforts in improving their scalability and performance by introducing semantic relaxation and also efforts in modeling and analyzing their performance.
Short bio: Philippas Tsigas is a Professor in the Department of Computing Science and Engineering at Chalmers University of Technology. He received a BSc in Mathematics from the University of Patras, Greece and a Ph.D. in Computer Engineering and Informatics from the same University in 1994. From 1993 to 1994 he was with the National Research Institute for Mathematics and Computer Science in the Netherlands (CWI), Amsterdam. From 1995 to 1997 he was with the Max-Planck Institute for Computer Science, Saarbrucken, Germany. He joined Chalmers University of Technology in 1997. He is the co-founder and the co-head of the Distributed Computing and Systems research group at Chalmers where he works on research topics in parallel and distributed computing and systems, data streaming, security, communication networks, and information visualization. His work appeared in over 120 conference papers and 45 journals.