Document Open Access Logo

Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract)

Author Faith Ellen

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2016.4.pdf
  • Filesize: 209 kB
  • 1 pages

Document Identifiers

Subject Classification

Keywords
  • Consensus
  • shared-memory systems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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.

Cite As Get BibTex

Faith Ellen. Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract). In 20th International Conference on Principles of Distributed Systems (OPODIS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 70, p. 4:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.OPODIS.2016.4

Author Details

Faith Ellen
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact