The evolution of distributed systems for graph neural networks and their origin in graph processing and deep learning: A survey

J Vatter, R Mayer, HA Jacobsen - ACM Computing Surveys, 2023 - dl.acm.org
Graph neural networks (GNNs) are an emerging research field. This specialized deep
neural network architecture is capable of processing graph structured data and bridges the …

Thinking like a vertex: A survey of vertex-centric frameworks for large-scale distributed graph processing

RR McCune, T Weninger, G Madey - ACM Computing Surveys (CSUR), 2015 - dl.acm.org
The vertex-centric programming model is an established computational paradigm recently
incorporated into distributed processing frameworks to address challenges in large-scale …

Powerlyra: Differentiated graph computation and partitioning on skewed graphs

R Chen, J Shi, Y Chen, B Zang, H Guan… - ACM Transactions on …, 2019 - dl.acm.org
Natural graphs with skewed distributions raise unique challenges to distributed graph
computation and partitioning. Existing graph-parallel systems usually use a “one-size-fits-all” …

NUMA-aware graph-structured analytics

K Zhang, R Chen, H Chen - Proceedings of the 20th ACM SIGPLAN …, 2015 - dl.acm.org
Graph-structured analytics has been widely adopted in a number of big data applications
such as social computation, web-search and recommendation systems. Though much prior …

Mosaic: Processing a trillion-edge graph on a single machine

S Maass, C Min, S Kashyap, W Kang… - Proceedings of the …, 2017 - dl.acm.org
Processing a one trillion-edge graph has recently been demonstrated by distributed graph
engines running on clusters of tens to hundreds of nodes. In this paper, we employ a single …

A State of Art: Survey for Concurrent Computation and Clustering of Parallel Computing for Distributed Systems

H Shukur, SRM Zeebaree, AJ Ahmed, RR Zebari… - Journal of Applied …, 2020 - jastt.org
In this paper, several works have been presented related to clustering parallel computing for
distributed systems. The trend of the paper is to focus on the strengths of previous works in …

Polygraph: Exposing the value of flexibility for graph processing accelerators

V Dadu, S Liu, T Nowatzki - 2021 ACM/IEEE 48th Annual …, 2021 - ieeexplore.ieee.org
Because of the importance of graph workloads and the limitations of CPUs/GPUs, many
graph processing accelerators have been proposed. The basic approach of prior …

A survey on graph processing accelerators: Challenges and opportunities

CY Gui, L Zheng, B He, C Liu, XY Chen… - Journal of Computer …, 2019 - Springer
Graph is a well known data structure to represent the associated relationships in a variety of
applications, eg, data science and machine learning. Despite a wealth of existing efforts on …

Parallelizing sequential graph computations

W Fan, W Yu, J Xu, J Zhou, X Luo, Q Yin, P Lu… - ACM Transactions on …, 2018 - dl.acm.org
This article presents GRAPE, a parallel GRAP h E ngine for graph computations. GRAPE
differs from prior systems in its ability to parallelize existing sequential graph algorithms as a …

Scalable graph processing frameworks: A taxonomy and open challenges

S Heidari, Y Simmhan, RN Calheiros… - ACM Computing Surveys …, 2018 - dl.acm.org
The world is becoming a more conjunct place and the number of data sources such as
social networks, online transactions, web search engines, and mobile devices is increasing …