In this chapter we look at JOSTLE, the multilevel graph-partitioning software package, and highlight some of the key research issues that it addresses. We first outline the core algorithms and place it in the context of the multilevel refinement paradigm. We then look at issues relating to its use as a tool for parallel processing and, in particular, partitioning in parallel. Since its first release in 1995, JOSTLE has been used for many mesh-based parallel scientific computing applications and so we also outline some enhancements such as multiphase mesh-partitioning, heterogeneous mapping and partitioning to optimise subdomain shap
As the efficiency of parallel software increases it is becoming common to measure near linear speedu...
31st Conference on Current Trends in Theory and Practice of Computer Science; Liptovsky Jan; Slovaki...
Graph Partitioning is an important load balancing problem in parallel processing. The simplest case ...
Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundame...
This paper surveys graph partitioning algorithms used for parallel computing, with an emphasis on th...
Graph partitioning is a technique which has applications in many fields of science. It is used to so...
Graph partitioning is a technique which has applications in many fields of science. It is used to so...
International audienceGraph partitioning is a technique used for solving many problems in scientific...
Many problems appearing in scientific computing and other areas can be formulated as a graph parti...
Multilevel algorithms are a successful class of optimisation techniques which address the mesh parti...
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. ...
International audienceGraph partitioning is a technique used for the solving of many problems in sci...
International audienceIn scientific computing, load balancing is a crucial step conditioning the per...
We describe two different approaches to multi-level graph partitioning (MGP). The first is an approa...
Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning prob...
As the efficiency of parallel software increases it is becoming common to measure near linear speedu...
31st Conference on Current Trends in Theory and Practice of Computer Science; Liptovsky Jan; Slovaki...
Graph Partitioning is an important load balancing problem in parallel processing. The simplest case ...
Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundame...
This paper surveys graph partitioning algorithms used for parallel computing, with an emphasis on th...
Graph partitioning is a technique which has applications in many fields of science. It is used to so...
Graph partitioning is a technique which has applications in many fields of science. It is used to so...
International audienceGraph partitioning is a technique used for solving many problems in scientific...
Many problems appearing in scientific computing and other areas can be formulated as a graph parti...
Multilevel algorithms are a successful class of optimisation techniques which address the mesh parti...
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. ...
International audienceGraph partitioning is a technique used for the solving of many problems in sci...
International audienceIn scientific computing, load balancing is a crucial step conditioning the per...
We describe two different approaches to multi-level graph partitioning (MGP). The first is an approa...
Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning prob...
As the efficiency of parallel software increases it is becoming common to measure near linear speedu...
31st Conference on Current Trends in Theory and Practice of Computer Science; Liptovsky Jan; Slovaki...
Graph Partitioning is an important load balancing problem in parallel processing. The simplest case ...