Transience Bounds for Distributed Algorithms

Bernadette Charron-Bost 1 Matthias Függer 2 Thomas Nowak 3
3 DYOGENE - Dynamics of Geometric Networks
CNRS - Centre National de la Recherche Scientifique : UMR8548, Inria Paris-Rocquencourt, DI-ENS - Département d'informatique de l'École normale supérieure
Abstract : A large variety of distributed systems, like some classical synchronizers, routers, or schedulers, have been shown to have a periodic behavior after an initial transient phase (Malka and Rajsbaum, WDAG 1991). In fact, each of these systems satisfies recurrence relations that turn out to be linear as soon as we consider max-plus or min-plus algebra. In this paper, we give a new proof that such systems are eventually periodic and a new upper bound on the length of the initial transient phase. Interestingly, this is the first asymptotically tight bound that is linear in the system size for various classes of systems. Another significant benefit of our approach lies in the straightforwardness of arguments: The proof is based on an easy convolution lemma borrowed from Nachtigall (Math. Method. Oper. Res. 46) instead of purely graph-theoretic arguments and involved path reductions found in all previous proofs.
Type de document :
Communication dans un congrès
Víctor Braberman, Laurent Fribourg. FORMATS 2013 - 11th International Conference Formal Modeling and Analysis of Timed Systems, Aug 2013, Buenos Aires, Argentina. Springer, 8053, pp.77-90, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-40229-6_6〉
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00993785
Contributeur : Thomas Nowak <>
Soumis le : mardi 20 mai 2014 - 16:21:03
Dernière modification le : jeudi 7 février 2019 - 16:55:38
Document(s) archivé(s) le : mercredi 20 août 2014 - 11:55:50

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Bernadette Charron-Bost, Matthias Függer, Thomas Nowak. Transience Bounds for Distributed Algorithms. Víctor Braberman, Laurent Fribourg. FORMATS 2013 - 11th International Conference Formal Modeling and Analysis of Timed Systems, Aug 2013, Buenos Aires, Argentina. Springer, 8053, pp.77-90, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-40229-6_6〉. 〈hal-00993785〉

Partager

Métriques

Consultations de la notice

485

Téléchargements de fichiers

161