An Asynchronous Computability Theorem for Fair Adversaries - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

An Asynchronous Computability Theorem for Fair Adversaries

(1) , (1) , (2)
1
2
Petr Kuznetsov
Yuan He
  • Function : Author
  • PersonId : 1014380

Abstract

This paper proposes a simple topological characterization of a large class of fair adversarial models via affine tasks: sub-complexes of the second iteration of the standard chromatic subdivision. We show that the task computability of a model in the class is precisely captured by iterations of the corresponding affine task. Fair adversaries include, but are not restricted to, the models of wait-freedom, t-resilience, and k-concurrency. Our results generalize and improve all previously derived topological characterizations of the ability of a model to solve distributed tasks.
Fichier principal
Vignette du fichier
paper.pdf (532.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01572257 , version 1 (06-08-2017)
hal-01572257 , version 2 (29-11-2017)
hal-01572257 , version 3 (23-02-2018)
hal-01572257 , version 4 (18-04-2020)

Identifiers

  • HAL Id : hal-01572257 , version 4

Cite

Petr Kuznetsov, Thibault Rieutord, Yuan He. An Asynchronous Computability Theorem for Fair Adversaries. 2017. ⟨hal-01572257v4⟩
180 View
458 Download

Share

Gmail Facebook Twitter LinkedIn More