An Asynchronous Computability Theorem for Fair Adversaries - Equipe Autonomic and Critical Embedded Systems Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

An Asynchronous Computability Theorem for Fair Adversaries

Petr Kuznetsov
Yuan He
  • Fonction : Auteur
  • PersonId : 1014380

Résumé

The 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 not restricted to, the models of wait-freedom, t-resilience, and k-concurrency. Our results generalize and improve all previously derived topological characterizations of distributed task computability.
Fichier principal
Vignette du fichier
paper.pdf (546.83 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et 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)

Identifiants

  • HAL Id : hal-01572257 , version 3

Citer

Petr Kuznetsov, Thibault Rieutord, Yuan He. An Asynchronous Computability Theorem for Fair Adversaries. 2017. ⟨hal-01572257v3⟩
194 Consultations
510 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More