Computers have undergone tremendous improvements in performance over the last 60
years, but those improvements have significantly slowed down over the last decade, owing …

In this paper we present and evaluate a parallel community detection algorithm derived from
the state-of-the-art Louvain modularity maximization method. Our algorithm adopts a novel …

We consider the single-source shortest path (SSSP) problem: given an undirected graph
with integer edge weights and a source vertex, find the shortest paths from to all other …

Breadth-First Search (BFS) is a core primitive for graph traversal and a basis for many higher-
level graph analysis algorithms. It is also representative of a class of parallel computations …

Graphs are an important abstraction used in many scientific fields. With the magnitude of
graph-structured data constantly increasing, effective data analytics requires efficient and …

We present a single-node, multi-GPU programmable graph processing library that allows
programmers to easily extend single-GPU graph algorithms to achieve scalable …

We introduce XtraPuLP, a new distributed-memory graph partitioner designed to process
trillion-edge graphs. XtraPuLP is based on the scalable label propagation community …

High-performance graph processing brings great benefits to a wide range of scientific
applications, eg, biology networks, recommendation systems, and social networks, where …

Graph processing, especially high-performance graph traversal, plays a more and more
important role in data analytics. The successor of Sunway TaihuLight, New Sunway, is …

We propose Slim Graph: the first programming model and framework for practical lossy
graph compression that facilitates high-performance approximate graph processing …