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 …

Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

A new method is presented for distributing data in sparse matrix-vector multiplication. The
method is two-dimensional, tries to minimize the true communication volume, and also tries …

We present an unsupervised technique for visual learning which is based on density
estimation in high-dimensional spaces using an eigenspace decomposition. Two types of …

Fully Homomorphic Encryption (FHE) enables the processing of encrypted data without
decrypting it. FHE has garnered significant attention over the past decade as it supports …

Data partitioning and load balancing are important components of parallel computations.
Many different partitioning strategies have been developed, with great effectiveness in …

We consider the multilevel paradigm and its potential to aid the solution of combinatorial
optimisation problems. The multilevel paradigm is a simple one, which involves recursive …

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 …

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

We present a new method for map** applications' MPI tasks to cores of a parallel
computer such that communication and execution time are reduced. We consider the case of …