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 …

There has been significant recent interest in parallel graph processing due to the need to
quickly analyze the large graphs available today. Many graph codes have been designed …

This announcement describes the problem based benchmark suite (PBBS). PBBS is a set of
benchmarks designed for comparing parallel algorithmic approaches, parallel programming …

Work stealing has proven to be an effective method for scheduling parallel programs on
multicore computers. To achieve high performance, work stealing distributes tasks between …

Algorithms operating on a graph setting are known to be highly irregular and unstructured.
This leads to workload imbalance and data locality challenge when these algorithms are …

The greedy sequential algorithm for maximal independent set (MIS) loops over the vertices
in an arbitrary order adding a vertex to the resulting set if and only if no previous neighboring …

We present Swarm, a novel architecture that exploits ordered irregular parallelism, which is
abundant but hard to mine with current software and hardware techniques. In this …

The DBSCAN method for spatial clustering has received significant attention due to its
applicability in a variety of data analysis tasks. There are fast sequential algorithms for …

In this paper we develop optimal algorithms in the binary-forking model for a variety of
fundamental problems, including sorting, semisorting, list ranking, tree contraction, range …

Connected components is a fundamental kernel in graph applications. The fastest existing
parallel multicore algorithms for connectivity are based on some form of edge sampling …