activity
20062025
most citedScheduling on Two Types of Resources: a Survey

22 citations · 27 across the 6 of their papers we have counts for

collaborators

7 papers

cs.LG2025★ 1 cited

Cache Management for Mixture-of-Experts LLMs -- extended version

Spyros Angelopoulos, Loris Marchal, Adrien Obrecht +1

Large language models (LLMs) have demonstrated remarkable capabilities across a variety of tasks. One of the main challenges towards the successful deployment of LLMs is memory man…

cs.DC2019★ 22 cited

Scheduling on Two Types of Resources: a Survey

Olivier Beaumont, Louis-claude Canon, Lionel Eyraud-Dubois +5

The evolution in the design of modern parallel platforms leads to revisit the scheduling jobs on distributed heterogeneous resources. The goal of this survey is to present the main…

cs.DC2014

Scheduling Trees of Malleable Tasks for Sparse Linear Algebra

Abdou Guermouche, Loris Marchal, Bertrand Simon +1

Scientific workloads are often described as directed acyclic task graphs. In this paper, we focus on the multifrontal factorization of sparse matrices, whose task graph is structur…

cs.DC2014

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…

cs.DC2014★ 4 cited

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,…

cs.DC2012

Scheduling tree-shaped task graphs to minimize memory and makespan

Loris Marchal, Oliver Sinnen, Frédéric Vivien

This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents a large IO file. A task can only be executed if all…