Balancing the workload of sophisticated simulations is inherently difficult, since we have to balance both computational workload and memory footprint over meshes that can change any time or yield unpredictable cost per mesh entity, while modern supercomputers and their interconnects start to exhibit fluctuating performance. We propose a novel lightweight balancing technique for MPI+X to accompany traditional, prediction‐based load balancing. It is a reactive diffusion approach that uses online measurements of MPI idle time to migrate tasks temporarily from overloaded to underemployed ranks. Tasks are deployed to ranks which otherwise would wait, processed with high priority, and made available to the overloaded ranks again. This migration ...
In parallel iterative applications, computational efficiency is essential for addressing large probl...
A large class of computational problems are characterised by frequent synchronisation, and computati...
We study codes deploying multiple MPI ranks to one node where each rank is parallelised with TBB. A...
Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physic...
Adaptive Mesh Refinement (AMR) is a prevalent method used by distributed-memory simulation applicati...
We study the performance behaviour of a seismic simulation using the ExaHyPE engine with a specific ...
Load imbalance is a long-standing source of inefficiency in high performance computing. The situati...
Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady pr...
The computational requirements for an adaptive solution of unsteady problems change as the simulatio...
Domain decomposition for regular meshes on parallel computers has traditionally been performed by ...
International audienceFinite-difference methods are commonplace in High Performance Computing applic...
International audienceFinite difference methods are commonplace in scientific computing. Despite the...
In parallel computing, obtaining maximal performance is often mandatory to solve large and complex p...
Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbala...
The largest supercomputers have millions of independent processors, and concurrency levels are rapid...
In parallel iterative applications, computational efficiency is essential for addressing large probl...
A large class of computational problems are characterised by frequent synchronisation, and computati...
We study codes deploying multiple MPI ranks to one node where each rank is parallelised with TBB. A...
Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physic...
Adaptive Mesh Refinement (AMR) is a prevalent method used by distributed-memory simulation applicati...
We study the performance behaviour of a seismic simulation using the ExaHyPE engine with a specific ...
Load imbalance is a long-standing source of inefficiency in high performance computing. The situati...
Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady pr...
The computational requirements for an adaptive solution of unsteady problems change as the simulatio...
Domain decomposition for regular meshes on parallel computers has traditionally been performed by ...
International audienceFinite-difference methods are commonplace in High Performance Computing applic...
International audienceFinite difference methods are commonplace in scientific computing. Despite the...
In parallel computing, obtaining maximal performance is often mandatory to solve large and complex p...
Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbala...
The largest supercomputers have millions of independent processors, and concurrency levels are rapid...
In parallel iterative applications, computational efficiency is essential for addressing large probl...
A large class of computational problems are characterised by frequent synchronisation, and computati...
We study codes deploying multiple MPI ranks to one node where each rank is parallelised with TBB. A...