Research Program
Application Domains
New Software and Platforms
New Results
- Creation of the start-up “Mumps Technologies SAS”
- Scheduling independent stochastic tasks under deadline and budget constraints
- Online scheduling of task graphs on heterogeneous platforms
- A generic approach to scheduling and checkpointing workflows
- Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms
- Scheduling independent stochastic tasks on heterogeneous cloud platforms
- Improved energy-aware strategies for periodic real-time tasks under reliability constraints
- Multilevel algorithms for acyclic partitioning of directed acyclic graphs
- A multi-dimensional Morton-ordered block storage for mode-oblivious tensor computations
- Effective heuristics for matchings in hypergraphs
- Karp-Sipser based kernels for bipartite graph matching
- Efficient and effective sparse tensor reordering
- High performance tensor–vector multiplication on shared-memory systems
- Matrix symmetrization and sparse direct solvers
- A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning
- Improving Locality-Aware Scheduling with Acyclic Directed Graph Partitioning
- Replication Is More Efficient Than You Think
- Generic matrix multiplication for multi-GPU accelerated distributed-memory platforms over PaRSEC
- Reservation strategies for stochastic jobs
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Research Program
Application Domains
New Software and Platforms
New Results
- Creation of the start-up “Mumps Technologies SAS”
- Scheduling independent stochastic tasks under deadline and budget constraints
- Online scheduling of task graphs on heterogeneous platforms
- A generic approach to scheduling and checkpointing workflows
- Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms
- Scheduling independent stochastic tasks on heterogeneous cloud platforms
- Improved energy-aware strategies for periodic real-time tasks under reliability constraints
- Multilevel algorithms for acyclic partitioning of directed acyclic graphs
- A multi-dimensional Morton-ordered block storage for mode-oblivious tensor computations
- Effective heuristics for matchings in hypergraphs
- Karp-Sipser based kernels for bipartite graph matching
- Efficient and effective sparse tensor reordering
- High performance tensor–vector multiplication on shared-memory systems
- Matrix symmetrization and sparse direct solvers
- A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning
- Improving Locality-Aware Scheduling with Acyclic Directed Graph Partitioning
- Replication Is More Efficient Than You Think
- Generic matrix multiplication for multi-GPU accelerated distributed-memory platforms over PaRSEC
- Reservation strategies for stochastic jobs
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Previous | 
Home