From the 1 of 2.5k papers with an AI index.
29.3k citations
- Centre National de la Recherche ScientifiqueFR568 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR170 papers
- Centre Inria de SaclayFR169 papers
- Sorbonne UniversitéFR157 papers
- Université Grenoble AlpesFR110 papers
- École Normale Supérieure - PSLFR108 papers
- Université Paris CitéFR107 papers
- Centre Inria de l'Université de LilleFR90 papers
- Centre Inria de l'Université Grenoble AlpesFR87 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR86 papers
- École Normale Supérieure de LyonFR84 papers
- École PolytechniqueFR83 papers
5 papers · 2 filters
The Next 700 Impossibility Results in Time-Varying Graphs
Nicolas Braud-Santoni, Swan Dubois, Mohamed-Hamza Kaaouachi +1
We address highly dynamic distributed systems modeled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergen…
Parallel scheduling of task trees with limited memory
Lionel Eyraud-Dubois, Loris Marchal, Oliver Sinnen +1
This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents some large data. A task can only be executed if all…
A Grammatical Approach to Data-centric Case Management in a Distributed Collaborative Environment
Eric Badouel, Loïc Hélouët, Georges-Edouard Kouamou +1
This paper presents a purely declarative approach to artifact-centric case management systems, and a decentralization scheme for this model. Each case is presented as a tree-like s…
Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes
Xavier Lacoste, Mathieu Faverge, George Bosilca +2
The ongoing hardware evolution exhibits an escalation in the number, as well as in the heterogeneity, of computing resources. The pressure to maintain reasonable levels of performa…
Analysis of Dynamic Scheduling Strategies for Matrix Multiplication on Heterogeneous Platforms
Olivier Beaumont, Loris Marchal
The tremendous increase in the size and heterogeneity of supercomputers makes it very difficult to predict the performance of a scheduling algorithm. Therefore, dynamic solutions,…