2014/02/11 by Bouzid, Zohir, Gafni, Eli, Kuznetsov, Petr · 1 citation
#C.2.4 #Data Structures and Algorithms (cs.DS) #Distributed #F.1.1 #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
paper · doi:10.48550/arxiv.1402.2446
The Iterated Immediate Snapshot model (IIS), due to its elegant geometrical representation, has become standard for applying topological reasoning to distributed computing. Its modular structure makes it easier to analyze than the more realistic (non-iterated) read-write Atomic-Snapshot memory model (AS). It is known that AS and IIS are equivalent with respect to wait-free task computability: a distributed task is solvable in AS if and only if it solvable in IIS. We observe, however, that this equivalence is not sufficient in order to explore solvability of tasks in sub-models of AS (i.e. proper subsets of its runs) or computability of long-lived objects, and a stronger equivalence relation is needed. In this paper, we consider adversarial sub-models of AS and IIS specified by the sets of processes that can be correct in a model run. We show that AS and IIS are equivalent in a strong way: a (possibly long-lived) object is implementable in AS under a given adversary if and only if it is implementable in IIS under the same adversary. %This holds whether the object is one-shot or long-lived. Therefore, the computability of any object in shared memory under an adversarial AS scheduler can be equivalently investigated in IIS.