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

The wait-free read-write memory model has been characterized as an iterated \emph{Immediate Snapshot} (IS) task. The IS task is \emph{affine}---it can be defined as a (sub)set of simplices of the standard chromatic subdivision. It is known that the task of \emph{Weak Symmetry Breaking} (WSB) cannot be represented as an affine task. 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, unlike WSB, "natural" by presenting the corresponding simple affine task captured by a subset of $2$-round IS runs. Our results imply the first combinatorial characterization of models equipped with abstractions other than read-write memory that applies to generic tasks.

[1]  Eli Gafni.  On the Wait-free Power of Iterated-immediate-snapshots , 1998 .

[2]  Pierre Fraigniaud,et al.  Automatically Adjusting Concurrency to the Level of Synchrony , 2014, DISC.

[3]  Maurice Herlihy,et al.  Subconsensus Tasks: Renaming Is Weaker Than Set Agreement , 2006, DISC.

[4]  Nancy A. Lynch,et al.  The BG distributed simulation algorithm , 2001, Distributed Computing.

[5]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[6]  Michel Raynal,et al.  Distributed Universality , 2016, Algorithmica.

[7]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, PODC '90.

[8]  Eli Gafni,et al.  A simple algorithmically reasoned characterization of wait-free computation (extended abstract) , 1997, PODC '97.

[9]  Eli Gafni.  The extended BG-simulation and the characterization of t-resiliency , 2009, STOC '09.

[10]  Rachid Guerraoui,et al.  Simulating Few by Many : Limited Concurrency = Set Consensus ( Extended Abstract ) , 2009 .

[11]  Michel Raynal,et al.  Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).

[12]  Eli Gafni,et al.  Immediate atomic snapshots and fast renaming , 1993, PODC '93.

[13]  Sergio Rajsbaum,et al.  Untangling Partial Agreement: Iterated x-consensus Simulations , 2015, SSS.

[14]  Petr Kuznetsov,et al.  Relating L-resilience and wait-freedom via hitting sets , 2011, ICDCN 2011.

[15]  Dmitry N. Kozlov,et al.  Chromatic subdivision of a simplicial complex , 2012 .

[16]  Petr Kuznetsov,et al.  Strong Equivalence Relations for Iterated Models , 2014, OPODIS.

[17]  Eli Gafni,et al.  Distributed Programming with Tasks , 2010, OPODIS.

[18]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[19]  Michel Raynal,et al.  The k-simultaneous consensus problem , 2010, Distributed Computing.

[20]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[21]  Michel Raynal,et al.  Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors , 2012, PODC '12.

[22]  Carole Delporte-Gallet,et al.  t-Resilient Immediate Snapshot Is Impossible , 2016, SIROCCO.

[23]  Achour Mostéfaoui,et al.  Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement , 2006, DISC.

[24]  Eli Gafni,et al.  Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony , 1998, PODC '98.

[25]  Maurice Herlihy,et al.  Distributed Computing Through Combinatorial Topology , 2013 .

[26]  R. Ho.  Algebraic Topology , 2022 .

[27]  Michel Raynal,et al.  The Iterated Restricted Immediate Snapshot Model , 2008, COCOON.

[28]  Petr Kuznetsov,et al.  A generalized asynchronous computability theorem , 2013, PODC.

[29]  Rachid Guerraoui,et al.  Generalized Universality , 2011, CONCUR.

[30]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[31]  Maurice Herlihy,et al.  Asynchronous Computability Theorems for t-Resilient Systems , 2016, DISC.

[32]  A W Tucker,et al.  On Combinatorial Topology. , 1932, Proceedings of the National Academy of Sciences of the United States of America.

[33]  Maurice Herlihy,et al.  The topology of shared-memory adversaries , 2010, PODC '10.