Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

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 …

We address the new problem of protecting volunteer computing systems from malicious
volunteers who submit erroneous results by presenting sabotage-tolerance mechanisms …

Scientists today have the ability to generate data at an unprecedented scale and rate and,
as a result, they must increasingly turn to parallel data processing engines to perform their …

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 …

Adaptive scientific computations require that periodic repartitioning (load balancing) occur
dynamically to maintain load balance. Hypergraph partitioning is a successful model for …

In parallel adaptive applications, the computational structure of the applications changes
over time, leading to load imbalances even though the initial load distributions were …

Adaptive scientific simulations require that periodic repartitioning occur dynamically
throughout the course of the computation. The repartitionings should be computed so as to …

Writing high-performance solvers for engineering applications is a delicate task. These
codes are often developed on an application to application basis, highly optimized to solve a …

We describe the design of a flexible load balancing framework and runtime software system
for supporting the development of adaptive applications on distributed-memory parallel …