Affine Tasks for k-Test-and-Set - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Affine Tasks for k-Test-and-Set

(1, 2, 3) , (4)
1
2
3
4

Abstract

The paper proposes a surprisingly simple characterization of a classical class of models of distributed computing, captured by an affine task : A subcomplex of the second iteration of the standard chromatic subdivision. We show that the class of affine task we propose has an element equivalent, regarding task solvability, to any wait-free shared-memory model in which processes have additionally access to k-test-and-set objects. Our results thus extend existing affine characterization beyond fair models.
Fichier principal
Vignette du fichier
paper.pdf (311.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01810601 , version 1 (08-06-2018)
hal-01810601 , version 2 (11-10-2020)

Identifiers

  • HAL Id : hal-01810601 , version 2

Cite

Petr Kuznetsov, Thibault Rieutord. Affine Tasks for k-Test-and-Set. 2020. ⟨hal-01810601v2⟩
88 View
121 Download

Share

Gmail Facebook Twitter LinkedIn More