Skip to Main content Skip to Navigation
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

https://hal.archives-ouvertes.fr/hal-01810601
Contributor : Thibault Rieutord <>
Submitted on : Friday, June 8, 2018 - 9:12:12 AM
Last modification on : Friday, April 9, 2021 - 4:28:05 PM
Long-term archiving on: : Sunday, September 9, 2018 - 2:15:14 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01810601, version 1

Collections

Citation

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

Share

Metrics

Record views

93

Files downloads

76