Brief announcement: Anonymous obstruction-free (n, k)-set agreement with n − k + 1 atomic read/write registers

Zohir Bouzid, Michel Raynal, Pierre Sutra

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

Abstract

This paper presents an obstruction-free solution to the (n, k)- set agreement problem in an asynchronous anonymous read/write system using solely (n-k+1) registers. We then extend this algorithm into (i) a space-optimal solution for the repeated version of (n, k)-set agreement, and (ii) an x-obstruction-free solution using (n-k +x) atomic registers (with 1 ≤ x ≤ k < n).

Original languageEnglish
Title of host publicationDistributed Computing - 29th International Symposium, DISC 2015, Proceedings
EditorsYoram Moses
PublisherSpringer Verlag
Pages669-670
Number of pages2
ISBN (Print)9783662486528
Publication statusPublished - 1 Jan 2015
Externally publishedYes
Event29th International Symposium on Distributed Computing, DISC 2015 - Tokyo, Japan
Duration: 7 Oct 20159 Oct 2015

Publication series

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

Conference

Conference29th International Symposium on Distributed Computing, DISC 2015
Country/TerritoryJapan
CityTokyo
Period7/10/159/10/15

Fingerprint

Dive into the research topics of 'Brief announcement: Anonymous obstruction-free (n, k)-set agreement with n − k + 1 atomic read/write registers'. Together they form a unique fingerprint.

Cite this