27 citations · 37 across the 12 of their papers we have counts for
13 papers
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…
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…
On the Combination of Silent Error Detection and Checkpointing
Guillaume Aupy, Anne Benoit, Thomas Hérault +3
In this paper, we revisit traditional checkpointing and rollback recovery strategies, with a focus on silent data corruption errors. Contrarily to fail-stop failures, such latent e…
Checkpointing strategies with prediction windows
Guillaume Aupy, Yves Robert, Frédéric Vivien +1
This paper deals with the impact of fault prediction techniques on checkpointing strategies. We suppose that the fault-prediction system provides prediction windows instead of exac…
Checkpointing algorithms and fault prediction
Guillaume Aupy, Yves Robert, Frédéric Vivien +1
This paper deals with the impact of fault prediction techniques on checkpointing strategies. We extend the classical first-order analysis of Young and Daly in the presence of a fau…
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…