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 条
  • [41] K-set Tilable Surfaces
    Fu, Chi-Wing
    Lai, Chi-Fu
    He, Ying
    Cohen-Or, Daniel
    ACM TRANSACTIONS ON GRAPHICS, 2010, 29 (04):
  • [42] POROSITY AND K-SET CONTRACTIONS
    ALVAREZ, JC
    BENAVIDES, TD
    BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA, 1992, 6A (02): : 227 - 232
  • [43] Permutations Fixing a k-set
    Eberhard, Sean
    Ford, Kevin
    Green, Ben
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2016, 2016 (21) : 6713 - 6731
  • [44] CHARACTERIZATION OF K-SET CONTRACTIONS
    WEBB, JRL
    ATTI DELLA ACCADEMIA NAZIONALE DEI LINCEI RENDICONTI-CLASSE DI SCIENZE FISICHE-MATEMATICHE & NATURALI, 1971, 50 (06): : 686 - &
  • [45] Deterministic K-set structure
    Ganguly, Sumit
    Majumder, Anirban
    INFORMATION PROCESSING LETTERS, 2008, 109 (01) : 27 - 31
  • [46] On the weakest failure detector ever
    Guerraoui, Rachid
    Herlihy, Maurice
    Kuznetsov, Petr
    Lynch, Nancy
    Newport, Calvin
    DISTRIBUTED COMPUTING, 2009, 21 (05) : 353 - 366
  • [47] On the Weakest Failure Detector Ever
    Guerraoui, Rachid
    Herlihy, Maurice
    Kouznetsov, Petr
    Lynch, Nancy
    Newport, Calvin
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 235 - 243
  • [48] On the Bichromatic k-Set Problem
    Chan, Timothy M.
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (04)
  • [49] On the weakest failure detector ever
    Rachid Guerraoui
    Maurice Herlihy
    Petr Kuznetsov
    Nancy Lynch
    Calvin Newport
    Distributed Computing, 2009, 21 : 353 - 366
  • [50] Brief Announcement: Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
    Biely, Martin
    Robinson, Peter
    Schmid, Ulrich
    PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 227 - 228
12345