A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2015

A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object

Abstract

—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 uniquely target the shared memory model. In this paper we propose an implementation of a Test&Set object for a message passing distributed system. 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) 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 are not aware of any such results.
Fichier principal
Vignette du fichier
main.pdf (351.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01075650 , version 1 (19-10-2014)
hal-01075650 , version 2 (11-02-2015)
hal-01075650 , version 3 (13-08-2015)

Identifiers

  • HAL Id : hal-01075650 , version 3

Cite

Emmanuelle Anceaume, François Castella, Achour Mostefaoui, Bruno Sericola. A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object. 2015. ⟨hal-01075650v3⟩
652 View
211 Download

Share

Gmail Facebook X LinkedIn More