29 citations
- Laboratoire de l'Informatique du ParallélismeFR12 papers
- Université de Versailles Saint-Quentin-en-YvelinesFR10 papers
- Université Paris-SaclayFR9 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Intel (United States)US4 papers
- Laboratoire de Chimie et Physique QuantiquesFR3 papers
- Université Toulouse III - Paul SabatierFR3 papers
- University of TwenteNL3 papers
- Atos (France)FR2 papers
- Centrale MéditerranéeFR2 papers
- Institut des Sciences Moléculaires de MarseilleFR2 papers
- Laboratoire de Recherche en InformatiqueFR2 papers
6 papers · 1 filter
Node-Type-Based Load-Balancing Routing for Parallel Generalized Fat-Trees
John Gliksberg, Jean-Noel Quintin, Pedro Javier Garcia
High-Performance Computing (HPC) clusters are made up of a variety of node types (usually compute, I/O, service, and GPGPU nodes) and applications don't use nodes of a different ty…
High-Quality Fault-Resiliency in Fat-Tree Networks (Extended Abstract)
John Gliksberg, Antoine Capra, Alexandre Louvet +2
Coupling regular topologies with optimized routing algorithms is key in pushing the performance of interconnection networks of HPC systems. In this paper we present Dmodc, a fast d…
Self-stabilization and byzantine tolerance for maximal independent
Johanne Cohen, Laurence Pilard, François Pirot +1
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by…
Self-Stabilization and Byzantine Tolerance for Maximal Independent Set
Johanne Cohen, Laurence Pilard, Jonas Sénizergues
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by…
A self-stabilizing algorithm for maximal matching in link-register model in moves
Johanne Cohen, Georges Manoussakis, Laurence Pilard +1
In the matching problem, each node maintains a pointer to one of its neighbor or to , and a maximal matching is computed when each node points either to a neighbor that itsel…
Time and Space Optimal Counting in Population Protocols
James Aspnes, Joffroy Beauquier, Janna Burman +1
This work concerns the general issue of combined optimality in terms of time and space complexity. In this context, we study the problem of (exact) counting resource-limited and pa…