Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) Graphs, ALgorithms and Combinatorics
Self-stabilizing local k-placement of replicas with minimal variance.
Volker Turau

08 December 2014, 15:30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche : Distributed algorithms

Résumé :
Large scale distributed systems require replication of resources to
amplify availability and to provide fault tolerance. The placement of
replicated resources significantly impacts performance. This paper
considers local k-placements: Each node of a network has to place k
replicas of a resource among its direct neighbors. The load of a node in
a given local k-placement is the number of replicas it stores. The local
k-placement problem is to achieve a preferably homogeneous distribution
of the loads. We present a novel self-stabilizing, distributed,
asynchronous, scalable algorithm for the k-placement problem such that
the standard deviation of the distribution of the loads assumes a local
minimum.

Pour en savoir plus :
Séminaires
Pierre Andrieu - Agrégation de classements pour le
Thursday 21 October 2021 - 00:00
Salle : 435 - PCRI-N
.............................................

A counting argument for graph colouring
Graph Theory
Friday 08 October 2021 - 11:00
Salle : 445 - PCRI-N
Francois Pirot .............................................

Demographic reconstruction from paleogenomes of th
Thursday 25 February 2021 - 14:00
Salle : 435 - PCRI-N
Nina Marchi .............................................

A Graph-based Similarity Approach to Classify Recu
Thursday 18 February 2021 - 14:00
Salle : 435 - PCRI-N
Coline Gianfrotta .............................................

"Answer Set Programming for computing constraints-
Thursday 04 February 2021 - 14:00
Salle : 435 - PCRI-N
Maxime Mahout .............................................