Multi-sided shared coins and randomized set-agreement

This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-coin algorithm is generalized to a multi-sided shared-coin algorithm, and it is shown how to use any multi-sided shared coin in order to obtain a random

• Type: Conference
• Year: 2010
• Where: SPAA
• Authors: Keren Censor Hillel
• Keywords: Asynchronous Shared-memory Systems, Distributed And Parallel Computing, Multi-sided Shared Coin, Multi-sided Shared-coin Algorithm, SPAA 2010