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 that find good partitionings of unstructured and irregular graphs are critical for the
efficient execution of scientific simulations on high performance parallel computers. This …

In this paper we explore the design space of creating a multi-threaded graph partitioner. We
present and compare multiple approaches for parallelizing each of the three phases of …

This is the first text explaining how to use the bulk synchronous parallel (BSP) model and the
freely available BSPlib communication library in parallel algorithm design and parallel …

Aging or cerebral diseases may induce architectural modifications in human brain
microvascular networks, such as capillary rarefaction. Such modifications limit blood and …

Multilevel optimization aims at reducing the cost of executing a target network-based
algorithm by exploiting coarsened, ie, reduced or simplified, versions of the network. There …

The graph-partitioning problem is to divide a graph into several pieces so that the number of
vertices in each piece is the same within some defined tolerance and the number of cut …

Sequential multi‐constraint graph partitioners have been developed to address the static
load balancing requirements of multi‐phase simulations. These work well when (i) the graph …

Multilevel algorithms are a successful class of optimization techniques which addresses the
mesh partitioning problem. They usually combine a graph contraction algorithm together …

Sequential multi-constraint graph partitioners have been developed to address the load
balancing requirements of multi-phase simulations. The efficient execution of large multi …