Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on Jun 11, 2015
Keren Censor-Hillel, Technion Are Lock-Free Algorithms Practically Wait-Free? I will describe recent research that addresses the gap between the insufficient theoretical progress guarantees of many concurrent implementations and the satisfactory conditions that are typically provided by them in practice. Specifically, while obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most non-blocking commercial code is only lock-free. On our quest to understand why in some cases this might be sufficient, we introduce a new methodology of analyzing algorithms under a stochastic scheduler. Based on joint work with Dan Alistarh and Nir Shavit. Brief Bio Keren Censor-Hillel is an Assistant Professor at the Department of Computer Science at the Technion. She received her PhD in 2010 from the Technion and was afterwards a Simons Postdoctoral Fellow at MIT. Her main research interests are in theory of computation and focus on distributed computing. Censor-Hillel received a Shalon Career Advancement Award and an Alon Fellowship, as well as additional research and teaching awards.