Wait-free k-set agreement is impossible

DOI10.1145/167088.167122zbMath1310.68041OpenAlexW2083306187MaRDI QIDQ5248476

Fotios Zaharoglou, Michael E. Saks

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (18)

An algorithmic approach to the asynchronous computability theorem ⋮ On the weakest failure detector ever ⋮ Geometric and combinatorial views on asynchronous computability ⋮ A computationally intractable problem on simplicial complexes ⋮ Communication pattern logic: epistemic and topological views ⋮ Iterated chromatic subdivisions are collapsible ⋮ Wait-free computing ⋮ Renaming and the weakest family of failure detectors ⋮ Closed schedulers: a novel technique for analyzing asynchronous protocols ⋮ The BG distributed simulation algorithm ⋮ An adaptive collect algorithm with applications ⋮ On set consensus numbers ⋮ A Sound Foundation for the Topological Approach to Task Solvability ⋮ An Introduction to the Topological Theory of Distributed Computing with Safe-consensus ⋮ A topological perspective on distributed network algorithms ⋮ Classifying rendezvous tasks of arbitrary dimension ⋮ The evolution of non-degenerate and degenerate rendezvous tasks ⋮ A classification of wait-free loop agreement tasks

This page was built for publication: Wait-free k-set agreement is impossible