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 …

Compiling for parallelism is a longstanding topic of compiler research. This book describes
the fundamental principles of compiling" regular" numerical programs for parallelism. We …

Partitioning a multi-dimensional data set into rectangular partitions subject to certain
constraints is an important problem that arises in many database applications, including …

We investigate the problem of processing a large amount of continuous spatial-keyword
queries over streaming data, which is essential in many applications such as location-based …

The authors study the implementation of dense linear algebra kernels, such as matrix
multiplication or linear system solvers, on heterogeneous networks of workstations. The …

Parallel spatially explicit agent-based models (SE-ABM) exploit high-performance and
parallel computing to simulate spatial dynamics of complex geographic systems. The …

Geometric partitioning is fast and effective for load-balancing dynamic applications,
particularly those requiring geometric locality of data (particle methods, crash simulations) …

The widespread use of GPS-enabled smartphones along with the popularity of micro-
blogging and social networking applications, eg, Twitter and Facebook, has resulted in the …

We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle
stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem …

We consider the problem of partitioning an array of n items into p intervals so that the
maximum weight of the intervals is minimized. The currently best known bound for this …