17 jan 2019
Anaïs Durand viendra faire une présentation d'une partie de ses travaux le 24 janvier 2019 à 13h30 en salle 301. A new notion of process failure explicitly related to contention has recently been introduced by Gadi Taubenfeld (NETYS 2018). More precisely, given a predefined contention threshold λ, this notion considers the execution in which process crashes are restricted to occur only when process contention is smaller than or equal to λ. If crashes occur after contention bypassed λ, there are no correctness guarantees. It was shown that, when λ = n-1, consensus can be solved in an n-process asynchronous read/write system despite the crash of one process, thereby circumventing the well-known FLP impossibility result. In this talk, I will present k-set agreement and renaming algorithms that are resilient to two types of process crash failures: "λ-constrained" crash failures (as previously defined) and classical crash failures.