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).
| Origin | Files produced by the author(s) |
|---|
Loading...