Essentials of Parallel Graph Analytics

12/15/2022
by   Muhammad Osama, et al.
0

We identify the graph data structure, frontiers, operators, an iterative loop structure, and convergence conditions as essential components of graph analytics systems based on the native-graph approach. Using these essential components, we propose an abstraction that captures all the significant programming models within graph analytics, such as bulk-synchronous, asynchronous, shared-memory, message-passing, and push vs. pull traversals. Finally, we demonstrate the power of our abstraction with an elegant modern C++ implementation of single-source shortest path and its required components.

READ FULL TEXT
research
06/02/2022

Shortest Path Networks for Graph Property Prediction

Most graph neural network models rely on a particular message passing pa...
research
12/02/2022

PSPC: Efficient Parallel Shortest Path Counting on Large-Scale Graphs

In modern graph analytics, the shortest path is a fundamental concept. N...
research
05/27/2023

Graph Inductive Biases in Transformers without Message Passing

Transformers for graph data are increasingly widely studied and successf...
research
11/14/2021

A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs

Given an n-vertex planar embedded digraph G with non-negative edge weigh...
research
01/24/2019

TigerGraph: A Native MPP Graph Database

We present TigerGraph, a graph database system built from the ground up ...
research
03/03/2020

Dynamic Graph Operations: A Consistent Non-blocking Approach

Graph algorithms enormously contribute to the domains such as blockchain...
research
08/09/2022

On Composing Communicating Systems

Communication is an essential element of modern software, yet programmin...

Please sign up or login with your details

Forgot password? Click here to reset