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 …

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 …

Sebs: A serverless benchmark suite for function-as-a-service computing

M Copik, G Kwasniewski, M Besta… - Proceedings of the …, 2021 - dl.acm.org
Function-as-a-Service (FaaS) is one of the most promising directions for the future of cloud
services, and serverless functions have immediately become a new middleware for building …

Gemini: A {Computation-Centric} distributed graph processing system

X Zhu, W Chen, W Zheng, X Ma - 12th USENIX Symposium on Operating …, 2016 - usenix.org
Traditionally distributed graph processing systems have largely focused on scalability
through the optimizations of inter-node communication and load balance. However, they …

The GAP benchmark suite

S Beamer, K Asanović, D Patterson - ar** to standardize
graph processing evaluations. Fewer differences between graph processing evaluations will …

Ligra: a lightweight graph processing framework for shared memory

J Shun, GE Blelloch - Proceedings of the 18th ACM SIGPLAN …, 2013 - dl.acm.org
There has been significant recent interest in parallel frameworks for processing graphs due
to their applicability in studying social networks, the Web graph, networks in biology, and …

X-stream: Edge-centric graph processing using streaming partitions

A Roy, I Mihailovic, W Zwaenepoel - Proceedings of the Twenty-Fourth …, 2013 - dl.acm.org
X-Stream is a system for processing both in-memory and out-of-core graphs on a single
shared-memory machine. While retaining the scatter-gather programming model with state …

Sisa: Set-centric instruction set architecture for graph mining on processing-in-memory systems

M Besta, R Kanakagiri, G Kwasniewski… - MICRO-54: 54th Annual …, 2021 - dl.acm.org
Simple graph algorithms such as PageRank have been the target of numerous hardware
accelerators. Yet, there also exist much more complex graph mining algorithms for problems …