Affine Tasks for k-Test-and-Set

Petr Kuznetsov, Thibault Rieutord

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The paper proposes a surprisingly simple characterization of task computability of the wait-free shared-memory model in which processes, in addition to read-write registers, have access to k-test-and-set objects. Our characterization is expressed in the form of an affine task: a subcomplex of some iteration of the standard chromatic subdivision. This appears to be the first topological characterization of a model in which processes communicate via long-lived objects beyond read-write registers.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Proceedings
EditorsStéphane Devismes, Neeraj Mittal
PublisherSpringer Science and Business Media Deutschland GmbH
Pages151-166
Number of pages16
ISBN (Print)9783030643478
DOIs
Publication statusPublished - 1 Jan 2020
Event22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2020 - Austin, United States
Duration: 18 Nov 202021 Nov 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12514 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2020
Country/TerritoryUnited States
CityAustin
Period18/11/2021/11/20

Keywords

  • Affine tasks
  • Distributed computability
  • Test-and-set

Fingerprint

Dive into the research topics of 'Affine Tasks for k-Test-and-Set'. Together they form a unique fingerprint.

Cite this