License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2016.27
URN: urn:nbn:de:0030-drops-70964
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7096/
Qadri, Ammar
m-Consensus Objects Are Pretty Powerful
Abstract
A recent paper by Afek, Ellen, and Gafni introduced a family of deterministic objects O_{m,k}, for m,k >= 2, with consensus numbers m such that, for each k >= 2, O_{m,k} is computationally less powerful than O_{m,k+1} in systems with at least mk+m+k processes. This paper gives a wait-free implementation of O_{m,k} from (m + 1)-consensus objects and registers in systems with any finite number of processes. In order to do so, it introduces a new family of objects which helps us to understand the power of m-consensus among more than m processes.
BibTeX - Entry
@InProceedings{qadri:LIPIcs:2017:7096,
author = {Ammar Qadri},
title = {{m-Consensus Objects Are Pretty Powerful}},
booktitle = {20th International Conference on Principles of Distributed Systems (OPODIS 2016)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-031-6},
ISSN = {1868-8969},
year = {2017},
volume = {70},
editor = {Panagiota Fatourou and Ernesto Jim{\'e}nez and Fernando Pedone},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7096},
URN = {urn:nbn:de:0030-drops-70964},
doi = {10.4230/LIPIcs.OPODIS.2016.27},
annote = {Keywords: Deterministic Consensus Hierarchy, Wait-free Implementation, Tournament}
}
|
Keywords: |
|
Deterministic Consensus Hierarchy, Wait-free Implementation, Tournament |
|
Collection: |
|
20th International Conference on Principles of Distributed Systems (OPODIS 2016) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
06.04.2017 |
