Randomized Message-Passing Test-and-Set

Emmanuelle Anceaume (1, 2) , François Castella (3, 4) , Achour Mostefaoui (5) , Bruno Sericola (6)

1 CIDRE - Confidentialité, Intégrité, Disponibilité et Répartition
2 CIDER
3 IRMAR - Institut de Recherche Mathématique de Rennes
4 IPSO - Invariant Preserving SOlvers
5 LINA - Laboratoire d'Informatique de Nantes Atlantique
6 DIONYSOS - Dependability Interoperability and perfOrmance aNalYsiS Of networkS

—This paper presents a solution to the well-known Test&Set operation in an asynchronous system prone to process crashes. Test&Set is a synchronization operation that, when invoked by a set of processes, returns yes to a unique process and returns no to all the others. Recently many advances in implementing Test&Set objects have been achieved, however all of them target the shared memory model. In this paper we propose an implementation of a Test&Set object in the message passing model. This implementation can be invoked by any number p ≤ n of processes where n is the total number of processes in the system. It has an expected individual step complexity in O(log p) against an oblivious adversary, and an expected individual message complexity in O(n). The proposed Test&Set object is built atop a new basic building block, called selector, that allows to select a winning group among two groups of processes. We propose a message-passing implementation of the selector whose step complexity is constant. We are not aware of any other implementation of the Test&Set operation in the message passing model.

Mots clés: -Test&Set; agreement problem; asynchronous message-passing system; crash failures; randomized algorithm; synchronization

Domaines: Informatique et théorie des jeux [cs.GT]

Emmanuelle Anceaume, François Castella, Achour Mostefaoui, Bruno Sericola. Randomized Message-Passing Test-and-Set. 2014. ⟨hal-01075650v1⟩