2026-07-23T05:51:41Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7073 2024-03-06T10:39:29Z ddc:004 open_access

Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract) Ellen, Faith Consensus shared-memory systems The participating set problem can be solved in an asynchronous system using only registers. I will gently explain this problem and its solution, followed by a new extension, called consistent ordered partition. Next, I will present a wait-free simulation by f + 1 processes of any setconsensus algorithm that tolerates f faults. I will also describe how to extend this simulation using consistent ordered partition. Finally, I will discuss how this extension can be used to prove that, within every level m > 1 of the consensus hierarchy, there is an infinite sequence of increasingly more powerful deterministic objects. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Faith Ellen 2017 Is Part Of LIPIcs, Volume 70, 20th International Conference on Principles of Distributed Systems (OPODIS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2016.4 urn:nbn:de:0030-drops-70736 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2016.4 eng https://creativecommons.org/licenses/by/3.0/legalcode