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 …

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 …

Dorylus: Affordable, scalable, and accurate {GNN} training with distributed {CPU} servers and serverless threads

J Thorpe, Y Qiao, J Eyolfson, S Teng, G Hu… - … USENIX Symposium on …, 2021 - usenix.org
A graph neural network (GNN) enables deep learning on structured graph data. There are
two major GNN training obstacles: 1) it relies on high-end servers with many GPUs which …

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” …

Graphit: A high-performance graph dsl

Y Zhang, M Yang, R Baghdadi, S Kamil… - Proceedings of the …, 2018 - dl.acm.org
The performance bottlenecks of graph applications depend not only on the algorithm and
the underlying hardware, but also on the size and structure of the input graph. As a result …

Theoretically efficient parallel graph algorithms can be fast and scalable

L Dhulipala, GE Blelloch, J Shun - ACM Transactions on Parallel …, 2021 - dl.acm.org
There has been significant recent interest in parallel graph processing due to the need to
quickly analyze the large graphs available today. Many graph codes have been designed …

GraphOne A Data Store for Real-time Analytics on Evolving Graphs

P Kumar, HH Huang - ACM Transactions on Storage (TOS), 2020 - dl.acm.org
There is a growing need to perform a diverse set of real-time analytics (batch and stream
analytics) on evolving graphs to deliver the values of big data to users. The key requirement …

Gluon: A communication-optimizing substrate for distributed heterogeneous graph analytics

R Dathathri, G Gill, L Hoang, HV Dang… - Proceedings of the 39th …, 2018 - dl.acm.org
This paper introduces a new approach to building distributed-memory graph analytics
systems that exploits heterogeneity in processor types (CPU and GPU), partitioning policies …

{RStream}: Marrying relational algebra with streaming for efficient graph mining on a single machine

K Wang, Z Zuo, J Thorpe, TQ Nguyen… - 13th USENIX Symposium …, 2018 - usenix.org
Graph mining is an important category of graph algorithms that aim to discover structural
patterns such as cliques and motifs in a graph. While a great deal of work has been done …

Marius: Learning massive graph embeddings on a single machine

J Mohoney, R Waleffe, H Xu, T Rekatsinas… - … on Operating Systems …, 2021 - usenix.org
We propose a new framework for computing the embeddings of large-scale graphs on a
single machine. A graph embedding is a fixed length vector representation for each node …