Synchronization using failure detectors

Many important synchronization problems in distributed computing are impossible to solve (in a fault-tolerant manner) in purely asynchronous systems, where message transmission delays and relative processor speeds are unbounded. It is then natural to seek for the minimal synchrony assumptions that are sufficient to solve a given synchronization problem. A convenient way to describe synchrony assumptions is using the failure detector abstraction. In this thesis, we determine the weakest failure detectors for several fundamental problems in distributed computing: solving fault-tolerant mutual exclusion, solving non-blocking atomic commit, and boosting the synchronization power of atomic objects. We conclude the thesis by a perspective on the very definition of failure detectors.

    Thèse École polytechnique fédérale de Lausanne EPFL, n° 3262 (2005)
    Section des systèmes de communication
    Faculté informatique et communications
    Institut d'informatique fondamentale
    Laboratoire de programmation distribuée
    Jury: Vassos Hadzilacos, Eric Ruppert, Mohammad Amin Shokrollahi, Emre Telatar

    Public defense: 2005-7-4


    Record created on 2005-05-18, modified on 2017-05-12

Related material