Early Deciding Synchronous Renaming in O(log f ) Rounds or Less

Abstract : Renaming is a fundamental problem in distributed computing, in which a set of n processes need to pick unique names from a namespace of limited size. In this paper, we present the first early-deciding synchronous renaming algorithms, that adapt their running time to the actual number of failures f in the execution. We show that, surprisingly, renaming can be solved in constant time if the number of failures f is limited to O(√n), while for general f ≤ n − 1 renaming can always be solved in O(log f ) communication rounds. In the wait-free case, i.e. for f = n − 1, our upper bounds match the Ω(log n) lower bound of Chaudhuri et al. [11].
Type de document :
Rapport
[Research Report] 2012
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00687555
Contributeur : Corentin Travers <>
Soumis le : lundi 14 mai 2012 - 16:02:59
Dernière modification le : dimanche 22 avril 2018 - 01:11:59
Document(s) archivé(s) le : jeudi 15 décembre 2016 - 00:02:37

Fichier

htmod-full.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00687555, version 2

Collections

Citation

Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers. Early Deciding Synchronous Renaming in O(log f ) Rounds or Less. [Research Report] 2012. 〈hal-00687555v2〉

Partager

Métriques

Consultations de la notice

203

Téléchargements de fichiers

64