Distributed processing of large-scale graph data has many practical applications and has
been widely studied. In recent years, a lot of distributed graph processing frameworks and …

We reduce the cost of communication and synchronization in graph processing by analyzing
the fastest way to process graphs: pushing the updates to a shared state or pulling the …

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 …

To relieve the stress on channel estimation and decoding complexity in cell-free massive
multiple-input multiple-output (MIMO) systems, user grouping problem is investigated in this …

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

Finding the shortest paths from a single source to all other vertices is a common problem in
graph analysis. The Bellman-Ford's algorithm is the solution that solves such a single …

Shortest Path Algorithms (SPAs) are established for solving shortest path problem (SPP)
mainly classified into various types. Advanced concepts are derived for solving the problem …

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 …

YGM is a general-purpose asynchronous distributed computing library for C++/MPI,
designed to handle the irregular data access patterns and small messages of graph …

The Single Source Shortest Path (SSSP) problem consists in finding the shortest paths from
a vertex (the source vertex) to all other vertices in a graph. SSSP has numerous …