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

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

Activités de recherche : Algorithmique distribuée

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
Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Maximum Independent Set in H-free graphs
Théorie des graphes
Friday 05 October 2018 - 14h30
Salle : 445 - PCRI-N
Edouard BONNET .............................................

A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 29 June 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................