Brief Announcement: Anonymous Obstruction-free (n, k)-Set Agreement with n−k+1 Atomic Read/Write Registers

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).
Document type :
Conference papers
Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing
Liste complète des métadonnées

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01207902
Contributor : Matthieu Roy <>
Submitted on : Thursday, October 1, 2015 - 3:07:40 PM
Last modification on : Wednesday, August 2, 2017 - 10:09:17 AM
Document(s) archivé(s) le : Saturday, January 2, 2016 - 11:16:24 AM

File

42-BA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01207902, version 1

Citation

Zohir Bouzid, Michel Raynal, Pierre Sutra. Brief Announcement: Anonymous Obstruction-free (n, k)-Set Agreement with n−k+1 Atomic Read/Write Registers. Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing. 〈hal-01207902〉

Share

Metrics

Record views

620

Files downloads

121