Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|

Carole Delporte-Gallet (1, 2) , Hugues Fauconnier (1, 2) , Eli Gafni (3) , Sergio Rajsbaum (4)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 GANG - Networks, Graphs and Algorithms
3 UCLA - Computer Science Department [Los Angeles]
4 Instituto de Matematicas [México]

When n processes communicate by writing to and reading from k < n MWMR registers the "communication bandwidth" precludes emulation of SWMR system, even non-blocking. Nevertheless, recently a positive result was shown that such a system either wait-free or obstruction-free can solve an interesting one-shot task. This paper demonstrates another such result. It shows that (n − 1)-set agreement can be solved obstruction-free with merely 2 MWMR registers. Achieving k-set agreement with n − k + 1 registers is a challenge. We make the first step toward it by showing k-set agreement with 2(n − k) registers.

Domaines: Autre [cs.OH]

Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum. Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|. NETYS 2013 - First International Conference Networked Systems, May 2013, Marrakech, Morocco. pp.28-41, ⟨10.1007/978-3-642-40148-0_3⟩. ⟨hal-00922423⟩