License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2016.6
URN: urn:nbn:de:0030-drops-70759
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7075/
Go to the corresponding LIPIcs Volume Portal


Gafni, Eli ; He, Yuan ; Kuznetsov, Petr ; Rieutord, Thibault

Read-Write Memory and k-Set Consensus as an Affine Task

pdf-format:
LIPIcs-OPODIS-2016-6.pdf (0.6 MB)


Abstract

The wait-free read-write memory model has been characterized as an iterated Immediate Snapshot (IS) task. The IS task is affine it can be defined as a (sub)set of simplices of the standard chromatic subdivision. In this paper, we highlight the phenomenon of a "natural" model that can be captured by an iterated affine task and, thus, by a subset of runs of the iterated immediate snapshot model. We show that the read-write memory model in which, additionally, k-set-consensus objects can be used is "natural" by presenting the corresponding simple affine task captured by a subset of 2-round IS runs. As an "unnatural" example, the model using the abstraction of Weak Symmetry Breaking (WSB) cannot be captured by a set of IS runs and, thus, cannot be represented as an affine task. Our results imply the first combinatorial characterization of models equipped with abstractions other than read-write memory that applies to generic tasks.

BibTeX - Entry

@InProceedings{gafni_et_al:LIPIcs:2017:7075,
  author =	{Eli Gafni and Yuan He and Petr Kuznetsov and Thibault Rieutord},
  title =	{{Read-Write Memory and k-Set Consensus as an Affine Task}},
  booktitle =	{20th International Conference on Principles of Distributed Systems (OPODIS 2016)},
  pages =	{6:1--6:17},
  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/7075},
  URN =		{urn:nbn:de:0030-drops-70759},
  doi =		{10.4230/LIPIcs.OPODIS.2016.6},
  annote =	{Keywords: iterated affine tasks, k-set consensus, k-concurrency, simplicial complexes, immediate snapshot}
}

Keywords: iterated affine tasks, k-set consensus, k-concurrency, simplicial complexes, immediate snapshot
Seminar: 20th International Conference on Principles of Distributed Systems (OPODIS 2016)
Issue Date: 2017
Date of publication: 29.03.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI