k-set agreement with limited accuracy failure detectors

DOI10.1145/343477.343536zbMath1314.68079OpenAlexW2017263659MaRDI QIDQ5176780

Achour Mostefaoui, Michel Raynal

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/343477.343536

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (11)

A necessary and sufficient condition for transforming limited accuracy failure detectors ⋮ On the computability power and the robustness of set agreement-oriented failure detector classes ⋮ Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Partial synchrony based on set timeliness ⋮ Tight bounds for \(k\)-set agreement with limited-scope failure detectors ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems ⋮ Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement ⋮ From adaptive renaming to set agreement ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound ⋮ Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems

This page was built for publication: k-set agreement with limited accuracy failure detectors