GraphVine: A Data Structure to Optimize Dynamic Graph Processing on GPUs

06/14/2023
by   Rohith Krishnan S, et al.
0

Graph processing on GPUs is gaining momentum due to the high throughputs observed compared to traditional CPUs, attributed to the vast number of processing cores on GPUs that can exploit parallelism in graph analytics. This paper discusses a graph data structure for dynamic graph processing on GPUs. Unlike static graphs, dynamic graphs mutate over their lifetime through vertex and/or edge batch updates. The proposed work aims to provide fast batch updates and graph querying without consuming too much GPU memory. Experimental results show improved initialization timings by 1968-1269024 insert timings by 30-30047 50-25262

READ FULL TEXT

page 1

page 14

page 15

page 16

page 18

page 19

page 21

page 22

research
05/28/2023

Meerkat: A framework for Dynamic Graph Algorithms on GPUs

Graph algorithms are challenging to implement due to their varying topol...
research
08/25/2019

A parallel priority queue with fast updates for GPU architectures

The high computational throughput of modern graphics processing units (G...
research
11/27/2022

Dynamic Kernel Sparsifiers

A geometric graph associated with a set of points P= {x_1, x_2, ⋯, x_n }...
research
03/25/2021

ButterFly BFS – An Efficient Communication Pattern for Multi Node Traversals

Breadth-First Search (BFS) is a building block used in a wide array of g...
research
01/21/2022

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU

In a general graph data structure like an adjacency matrix, when edges a...
research
02/17/2022

Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs

Sparse matrix multiplication (SpGEMM) is a fundamental kernel used in ma...
research
06/26/2019

A Stricter Heap Separating Points-To Logic

Dynamic memory issues are hard to locate and may cost much of a developm...

Please sign up or login with your details

Forgot password? Click here to reset