A characterization of colorless anonymous t-resilient task computability

A task is a distributed problem for $n$ processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output value. A task is colorless if each process can adopt the input or output value of another process. Colorless tasks are well studied in the non-anonymous shared-memory model where each process has a distinct identifier that can be used to access a single-writer/multi-reader shared register. In the anonymous case, where processes have no identifiers and communicate through multi-writer/multi-reader registers, there is a recent topological characterization of the colorless tasks that are solvable when any number of asynchronous processes may crash. In this paper we study the case where at most $t$ processes may crash, where $1 \le t < n$. We prove that a colorless task is $t$-resilient solvable non-anonymously if and only if it is $t$-resilient solvable anonymously. This implies a complete characterization of colorless anonymous t-resilient asynchronous task computability.

[1]  Maurice Herlihy,et al.  A classification of wait-free loop agreement tasks , 2003, Theor. Comput. Sci..

[2]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

[3]  Carole Delporte-Gallet,et al.  Two Consensus Algorithms with Atomic Registers and Failure Detector Omega , 2009, ICDCN.

[4]  Corentin Travers,et al.  Anonymity-Preserving Failure Detectors , 2016, DISC.

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

[6]  Rati Gelashvili.  On the optimal space complexity of consensus for anonymous processes , 2018, Distributed Computing.

[7]  Rachid Guerraoui,et al.  Anonymous and fault-tolerant shared-memory computing , 2007, Distributed Computing.

[8]  Maurice Herlihy,et al.  The decidability of distributed decision tasks (extended abstract) , 1997, STOC '97.

[9]  Sergio Rajsbaum,et al.  Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times , 2017, 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

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

[11]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[12]  Hagit Attiya,et al.  Computing in Totally Anonymous Asynchronous Shared Memory Systems , 1998, DISC.

[13]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[14]  Carole Delporte-Gallet,et al.  Linear space bootstrap communication schemes , 2015, Theor. Comput. Sci..

[15]  Michel Raynal,et al.  Value-Based Sequential Consistency for Set Objects in Dynamic Distributed Systems , 2010, Euro-Par.

[16]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[17]  Maurice Herlihy,et al.  Simulations and reductions for colorless tasks , 2012, PODC '12.

[18]  Petr Kuznetsov,et al.  On the uncontended complexity of anonymous agreement , 2017, Distributed Computing.

[19]  Michel Raynal,et al.  The renaming problem in shared memory systems: An introduction , 2011, Comput. Sci. Rev..

[20]  Hagit Attiya.  Adapting to Point Contention with Long-Lived Safe Agreement , 2006, SIROCCO.

[21]  Sam Toueg,et al.  Wakeup under Read/Write Atomicity , 1990, WDAG.

[22]  Nayuta Yanagisawa,et al.  Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model , 2016, Theory of Computing Systems.

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

[24]  Maurice Herlihy,et al.  From wait-free to arbitrary concurrent solo executions in colorless distributed computing , 2017, Theor. Comput. Sci..

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

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

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

[28]  Michel Raynal,et al.  Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects , 2016, SIAM J. Comput..

[29]  Faith Ellen,et al.  The space complexity of unbounded timestamps , 2008, Distributed Computing.