Previous | 
Home
Section: Overall Objectives
Highlights of the Year
Anne Benoit, Yves Robert and Frédéric Vivien published a textbook entitled “A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis” [40] .
Overall Objectives
Research Program
Application Domains
Software and Platforms
New Results
- Scheduling tree-shaped task graphs to minimize memory and makespan
- Model and complexity results for tree traversals on hybrid platforms
- On the combination of silent error detection and checkpointing
- Checkpointing algorithms and fault prediction
- Mapping applications on volatile resources
- Using group replication for resilience on exascale systems
- Unified model for assessing checkpointing protocols at extreme-scale
- Revisiting the double checkpointing algorithm
- Multi-criteria checkpointing strategies: Optimizing response-time versus resource utilization
- Optimal checkpointing period: Time vs. energy
- Energy-aware checkpointing of divisible tasks with soft or hard deadlines
- Assessing the performance of energy-aware mappings
- Computing the throughput of probabilistic and replicated streaming applications
- Reliability and performance optimization of pipelined real-time systems
- Scheduling linear chain streaming applications on heterogeneous systems with failures
- A survey of pipelined workflow scheduling: Models and algorithms
- Reclaiming the energy of a schedule: Models and algorithms
- Non-clairvoyant reduction algorithms for heterogeneous platforms
- Non-linear divisible loads: There is no free lunch
- Direct solvers for sparse linear systems
- Push-relabel based algorithms for the maximum transversal problem
- Constructing elimination trees for sparse unsymmetric matrices
- Semi-matching algorithms for scheduling parallel tasks under resource constraints
- Maximum cardinality bipartite matching algorithms on GPUs
- Analysis of partitioning models and metrics in parallel sparse matrix-vector multiplication
- On partitioning and reordering problems in a hierarchically parallel hybrid linear solver
- UMPA: A Multi-objective, multi-level partitioner for communication minimization
- A Partitioning-based divisive clustering technique for maximizing the modularity
- Randomized matching heuristics with quality guarantees on shared memory parallel computers
- On the minimum edge cover and vertex partition by quasi-cliques problems
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
Overall Objectives
Research Program
Application Domains
Software and Platforms
New Results
- Scheduling tree-shaped task graphs to minimize memory and makespan
- Model and complexity results for tree traversals on hybrid platforms
- On the combination of silent error detection and checkpointing
- Checkpointing algorithms and fault prediction
- Mapping applications on volatile resources
- Using group replication for resilience on exascale systems
- Unified model for assessing checkpointing protocols at extreme-scale
- Revisiting the double checkpointing algorithm
- Multi-criteria checkpointing strategies: Optimizing response-time versus resource utilization
- Optimal checkpointing period: Time vs. energy
- Energy-aware checkpointing of divisible tasks with soft or hard deadlines
- Assessing the performance of energy-aware mappings
- Computing the throughput of probabilistic and replicated streaming applications
- Reliability and performance optimization of pipelined real-time systems
- Scheduling linear chain streaming applications on heterogeneous systems with failures
- A survey of pipelined workflow scheduling: Models and algorithms
- Reclaiming the energy of a schedule: Models and algorithms
- Non-clairvoyant reduction algorithms for heterogeneous platforms
- Non-linear divisible loads: There is no free lunch
- Direct solvers for sparse linear systems
- Push-relabel based algorithms for the maximum transversal problem
- Constructing elimination trees for sparse unsymmetric matrices
- Semi-matching algorithms for scheduling parallel tasks under resource constraints
- Maximum cardinality bipartite matching algorithms on GPUs
- Analysis of partitioning models and metrics in parallel sparse matrix-vector multiplication
- On partitioning and reordering problems in a hierarchically parallel hybrid linear solver
- UMPA: A Multi-objective, multi-level partitioner for communication minimization
- A Partitioning-based divisive clustering technique for maximizing the modularity
- Randomized matching heuristics with quality guarantees on shared memory parallel computers
- On the minimum edge cover and vertex partition by quasi-cliques problems
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography