Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Affine Tasks for k-Test-and-Set

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Thibault Rieutord Connect in order to contact the contributor
Submitted on : Sunday, October 11, 2020 - 12:21:54 PM
Last modification on : Thursday, February 17, 2022 - 10:08:04 AM


Files produced by the author(s)


  • HAL Id : hal-01810601, version 2


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



Record views


Files downloads