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 条
  • [31] A non-topological proof for the impossibility of k-set agreement
    Attiya, Hagit
    Castaneda, Armando
    THEORETICAL COMPUTER SCIENCE, 2013, 512 : 41 - 48
  • [32] Optimization over k-set polytopes and efficient k-set enumeration
    Andrzejak, A
    Fukuda, K
    ALGORITHMS AND DATA STRUCTURES, 1999, 1663 : 1 - 12
  • [33] Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
    Biely, Martin
    Robinson, Peter
    Schmid, Ulrich
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2011, 7109 : 299 - +
  • [34] A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus
    Galeana, Hugo Rincon
    Winkler, Kyrill
    Schmid, Ulrich
    Rajsbaum, Sergio
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2019, 2019, 11914 : 307 - 322
  • [35] Gracefully degrading consensus and k-set agreement in directed dynamic networks
    Biely, Martin
    Robinson, Peter
    Schmid, Ulrich
    Schwarz, Manfred
    Winkler, Kyrill
    THEORETICAL COMPUTER SCIENCE, 2018, 726 : 41 - 77
  • [36] k-set groups
    Sigley, DT
    ANNALS OF MATHEMATICS, 1940, 41 : 767 - 770
  • [37] The weakest failure detector for solving election problems in asynchronous distributed systems
    Park, SH
    EURASIA-ICT 2002: INFORMATION AND COMMUNICATION TECHNOLOGY, PROCEEDINGS, 2002, 2510 : 945 - 952
  • [38] Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
    Mostefaoui, Achour
    Moumen, Hamouma
    Raynal, Michel
    THEORETICAL COMPUTER SCIENCE, 2018, 709 : 80 - 97
  • [39] (anti-Ωx x Σz)-Based k-Set Agreement Algorithms
    Bouzid, Zohir
    Travers, Corentin
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2010, 6490 : 189 - +
  • [40] Wait-free k-set agreement is impossible:: The topology of public knowledge
    Saks, M
    Zaharoglou, F
    SIAM JOURNAL ON COMPUTING, 2000, 29 (05) : 1449 - 1483
12345