27 May 2014, 10:30 - 27 May 2014, 11:30 Salle/Bat : 465/PCRI-N
Contact : rachid.guerraoui@epfl.ch
Activités de recherche : High-performance computing
Résumé :
This talk will constitute a brief introductory tutorial of one of the most elegant concepts in distributed algorithms: the wait-free hierarchy, as introduced by Maurice Herlihy. In short, this hierarchy classifies distributed data structures based on the "hardness" of implementing them, which is it self captured by a simple integer. The tutorial will present the underlying motivation, the main results, including their practical ramifications, and the open challenges.
