We propose a new problem formulation for graph partitioning that is tailored to the needs of time-critical simulations on modern heterogeneous supercomputers
We present approximation algorithms for balanced partitioning problems. These problems are notorious...
International audienceHypergraph and graph partitioning tools are used to partition work for efficie...
A hypergraph model for mapping applications with an all-neighbor communication pattern to distribute...
Load imbalance in an application can lead to degradation of performance and a significant drop in sy...
International audienceWe investigate one dimensional partitioning of sparse matrices under a given o...
The datasets in many fields of science and engineering are growing rapidly with the recent ad-vances...
A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calcul...
Graph partitioning is a topic of extensive interest, with applications to parallel processing. In th...
Load balancing in large parallel systems with distributed memory is a difficult task often influenci...
Given a problem that can be represented as a graph with nodes and edges, how can we efficiently expl...
The amount of data generated every day is growing exponentially in the big data era. A significant p...
A well-balanced graph partition with small edge cut ratio is usually preferred because it cuts down ...
This extended abstract presents a survey of combinatorial problems encountered in scientific computa...
Realizing the potential of massively parallel machines requires good solutions to the problem of map...
Graph partitioning is a topic of extensive interest, with applications to parallel processing. In th...
We present approximation algorithms for balanced partitioning problems. These problems are notorious...
International audienceHypergraph and graph partitioning tools are used to partition work for efficie...
A hypergraph model for mapping applications with an all-neighbor communication pattern to distribute...
Load imbalance in an application can lead to degradation of performance and a significant drop in sy...
International audienceWe investigate one dimensional partitioning of sparse matrices under a given o...
The datasets in many fields of science and engineering are growing rapidly with the recent ad-vances...
A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calcul...
Graph partitioning is a topic of extensive interest, with applications to parallel processing. In th...
Load balancing in large parallel systems with distributed memory is a difficult task often influenci...
Given a problem that can be represented as a graph with nodes and edges, how can we efficiently expl...
The amount of data generated every day is growing exponentially in the big data era. A significant p...
A well-balanced graph partition with small edge cut ratio is usually preferred because it cuts down ...
This extended abstract presents a survey of combinatorial problems encountered in scientific computa...
Realizing the potential of massively parallel machines requires good solutions to the problem of map...
Graph partitioning is a topic of extensive interest, with applications to parallel processing. In th...
We present approximation algorithms for balanced partitioning problems. These problems are notorious...
International audienceHypergraph and graph partitioning tools are used to partition work for efficie...
A hypergraph model for mapping applications with an all-neighbor communication pattern to distribute...
DOI
Add to ORKG