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

Zohir Bouzid (1) , Michel Raynal (2, 1) , Pierre Sutra (3)

1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
2 IUF - Institut universitaire de France
3 IIUN - Institut d'Informatique [Neuchâtel]

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).

Domains: Distributed, Parallel, and Cluster Computing [cs.DC]; Information Retrieval [cs.IR]

Zohir Bouzid, Michel Raynal, Pierre Sutra. Brief Announcement: Anonymous Obstruction-free (n, k)-Set Agreement with n−k+1 Atomic Read/Write Registers. DISC 2015, Toshimitsu Masuzawa, Oct 2015, Tokyo, Japan. ⟨hal-01207902⟩