Brief announcement: Self-stabilizing spanning tree algorithm for large scale systems

Thomas Hérault 1, 2 Pierre Lemarinier 2 Olivier Peres 2 Laurence Pilard 2 Joffroy Beauquier 1, 2
1 GRAND-LARGE - Global parallel and distributed computing
LRI - Laboratoire de Recherche en Informatique, LIFL - Laboratoire d'Informatique Fondamentale de Lille, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : We introduce a self-stabilizing algorithm that builds and maintains a spanning tree topology on any large scale system. We assume that the existing topology is a complete graph and that nodes may arrive or leave at any time. To cope with the large number of processes of a grid or a peer to peer system, we limit the memory usage of each process to a small constant number of variables, combining this with previous results concerning failure detectors and resource discovery.
Type de document :
Communication dans un congrès
Springer. SSSE 2006 : Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2006, Dallas, Texas, United States. Springer, 4280, pp.574-575, 2006, LNCS. 〈10.1007/978-3-540-49823-0_44〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00695045
Contributeur : Ist Rennes <>
Soumis le : lundi 7 mai 2012 - 14:28:49
Dernière modification le : jeudi 11 janvier 2018 - 06:22:14

Identifiants

Citation

Thomas Hérault, Pierre Lemarinier, Olivier Peres, Laurence Pilard, Joffroy Beauquier. Brief announcement: Self-stabilizing spanning tree algorithm for large scale systems. Springer. SSSE 2006 : Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2006, Dallas, Texas, United States. Springer, 4280, pp.574-575, 2006, LNCS. 〈10.1007/978-3-540-49823-0_44〉. 〈hal-00695045〉

Partager

Métriques

Consultations de la notice

163