In recent years, significant advances have been made in the design and evaluation of
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …

The present book provides an introduction to using space-filling curves (SFC) as tools in
scientific computing. Special focus is laid on the representation of SFC and on resulting …

We describe RAGE, the'radiation adaptive grid Eulerian'radiation-hydrodynamics code,
including its data structures, its parallelization strategy and performance, its hydrodynamic …

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 …

Preliminary verification and validation of an efficient Euler solver for adaptively refined
Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method …

Computation of the Fock matrix is currently the limiting factor in the application of Hartree-
Fock and hybrid Hartree-Fock/density functional theories to larger systems. Computation of …

Matrix multiplication is an important kernel in linear algebra algorithms, and the performance
of both serial and parallel implementations is highly dependent on the memory system …

Programming languages that provide multidimensional arrays and a flat linear model of
memory must implement a mapping between these two domains to order array elements in …

The one-dimensional decomposition of nonuniform workload arrays with optimal load
balancing is investigated. The problem has been studied in the literature as the “chains-on …

The Zoltan dynamic load balancing library provides applications with a reusable object
oriented interface to several load balancing techniques, including coordinate bisection …