Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GALaC
Scalable Load Balancing - Distributed Algorithms and the Packing Model
Vinicius Marino Calvo Torres de Freitas

20 September 2019, 14h30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche : Algorithmique distribuée

Résumé :
Load imbalance is a recurring problem in High Performance Computing (HPC), which leads to suboptimal performance via the under-use of available resources.
As computing systems grow larger, resource management and load balancing become a costly process, especially for dynamic applications that demand periodical workload balance.
With this in mind, we believe that future generation load balancing algorithms should look towards scaling along computing systems.
In order to express solutions to the aforementioned issues, we propose a distributed scheduling model based on large-scale parallel machines and HPC systems.
Additionally, we present a task packing model to minimize the decision costs of distributed algorithms, and present two scheduling strategies implemented in the Charm++ runtime system that use said model.

Pour en savoir plus :
Séminaires
The Domino Problem is undecidable on surface group
Combinatoire
Friday 27 September 2019 - 14h30
Salle : 445 - PCRI-N
Nathalie Aubrun .............................................

Scalable Load Balancing - Distributed Algorithms a
Algorithmique distribuée
Friday 20 September 2019 - 14h30
Salle : 445 - PCRI-N
Vinicius Marino Calvo Torres de Freitas .............................................

graph algorithms to help molecular construction
Théorie des graphes
Friday 07 June 2019 - 14h30
Salle : 445 - PCRI-N
Stefi Nouleho .............................................

Sur le nombre des (d,k)-polytopes
Combinatoire
Friday 24 May 2019 - 14h30
Salle : 455 - PCRI-N
Rado Rakotonarivo .............................................

Predicting the structure of RNA-binding protein re
Thursday 23 May 2019 - 00h00
Salle : 465 - PCRI-N
François Major .............................................