The Weakest Failure Detector for Solving k-Set Agreement

被引：5
|
作者：
Gafni, Eli [1 ]
Kuznetsov, Petr [1 ]
机构：
[1] TU Berlin, Deutsch Telekom Labs, D-10587 Berlin, Germany
来源：
PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING | 2009年
关键词：
k-set agreement; synchrony assumptions; failure detectors; BG-simulation;
D O I：
10.1145/1582716.1582735
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact amount of synchrony needed for solving a given distributed computing problem. In this paper, we determine the weakest failure detector for solving k-set agreement among n processes (n > k) using reads and writes in shared memory, regardless of the assumptions on when and where failures might occur. This failure detector is derived directly from the impossibility of wait-free k+1-process k-set agreement. Our approach can be viewed as an extension of the asynchronous BG-simulation technique to partially synchronous systems.
引用
收藏
页码：83 / 91
页数：9
相关论文
共 50 条
  • [21] Tight bounds for k-set agreement with limited-scope failure detectors
    Herlihy, M
    Penso, LD
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2003, 2848 : 279 - 291
  • [22] Tight bounds for k-set agreement with limited-scope failure detectors
    Herlihy, M
    Penso, LD
    DISTRIBUTED COMPUTING, 2005, 18 (02) : 157 - 166
  • [23] Optimal Algorithms for Synchronous Byzantine k-Set Agreement
    Delporte-Gallet, Carole
    Fauconnier, Hugues
    Raynal, Michel
    Safir, Mouna
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS (SSS 2022), 2022, 13751 : 178 - 192
  • [24] Optimal algorithms for synchronous Byzantine k-set agreement
    Delporte-Gallet, Carole
    Fauconnier, Hugues
    Raynal, Michel
    Safir, Mouna
    THEORETICAL COMPUTER SCIENCE, 2023, 973
  • [25] In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement
    Raynal, Michel
    Travers, Corentin
    PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2006, 4305 : 3 - 19
  • [26] Implementing the weakest failure detector for solving the consensus problem
    Larrea, Mikel
    Fernandez Anta, Antonio
    Arevalo, Sergio
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2013, 28 (06) : 537 - 555
  • [27] Optimal implementation of the weakest failure detector for solving consensus
    Larrea, M
    Fernández, A
    Arévalo, S
    19TH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS - PROCEEDINGS, 2000, : 52 - 59
  • [28] Optimal implementation of the weakest failure detector for solving consensus
    Larrea, Mikel
    Fernandez, Antonio
    Arevalo, Sergio
    Proceedings of the IEEE Symposium on Reliable Distributed Systems, 2000, : 52 - 59
  • [29] A Non-topological Proof for the Impossibility of k-Set Agreement
    Attiya, Hagit
    Castaneda, Armando
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 2011, 6976 : 108 - +
  • [30] Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems
    Mostefaoui, Achour
    Raynal, Michel
    Stainer, Julien
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 2011, 6976 : 341 - 355
12345