The N3XT approach to energy-efficient abundant-data computing

MMS Aly, TF Wu, A Bartolo, YH Malviya… - Proceedings of the …, 2018 - ieeexplore.ieee.org
The world's appetite for analyzing massive amounts of structured and unstructured data has
grown dramatically. The computational demands of these abundant-data applications, such …

Legion: Automatically Pushing the Envelope of {Multi-GPU} System for {Billion-Scale}{GNN} Training

J Sun, L Su, Z Shi, W Shen, Z Wang, L Wang… - 2023 USENIX Annual …, 2023 - usenix.org
Graph neural network (GNN) has been widely applied in real-world applications, such as
product recommendation in e-commerce platforms and risk control in financial management …

Detecting and characterizing bots that commit code

T Dey, S Mousavi, E Ponce, T Fry, B Vasilescu… - Proceedings of the 17th …, 2020 - dl.acm.org
Background: Some developer activity traditionally performed manually, such as making
code commits, opening, managing, or closing issues is increasingly subject to automation in …

An analysis of the graph processing landscape

ME Coimbra, AP Francisco, L Veiga - journal of Big Data, 2021 - Springer
The value of graph-based big data can be unlocked by exploring the topology and metrics of
the networks they represent, and the computational approaches to this exploration take on …

Graphene:{Fine-Grained}{IO} Management for Graph Computing

H Liu, HH Huang - 15th USENIX Conference on File and Storage …, 2017 - usenix.org
As graphs continue to grow, external memory graph processing systems serve as a
promising alternative to inmemory solutions for low cost and high scalability. Unfortunately …

Effective and efficient community search over large directed graphs

Y Fang, Z Wang, R Cheng, H Wang… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Communities are prevalent in social networks, knowledge graphs, and biological networks.
Recently, the topic of community search (CS), extracting a dense subgraph containing a …

Traversing large graphs on GPUs with unified memory

P Gera, H Kim, P Sao, H Kim, D Bader - Proceedings of the VLDB …, 2020 - dl.acm.org
Due to the limited capacity of GPU memory, the majority of prior work on graph applications
on GPUs has been restricted to graphs of modest sizes that fit in memory. Recent hardware …

KADABRA is an adaptive algorithm for betweenness via random approximation

M Borassi, E Natale - Journal of Experimental Algorithmics (JEA), 2019 - dl.acm.org
We present KADABRA, a new algorithm to approximate betweenness centrality in directed
and undirected graphs, which significantly outperforms all previous approaches on real …

Out-of-core edge partitioning at linear run-time

R Mayer, K Orujzade… - 2022 IEEE 38th …, 2022 - ieeexplore.ieee.org
Graph edge partitioning is an important prepro-cessing step to optimize distributed
computing jobs on graph-structured data. The edge set of a given graph is split into k equally …

Extrav: boosting graph processing near storage with a coherent accelerator

J Lee, H Kim, S Yoo, K Choi, HP Hofstee… - Proceedings of the …, 2017 - dl.acm.org
In this paper, we propose ExtraV, a framework for near-storage graph processing. It is based
on the novel concept of graph virtualization, which efficiently utilizes a cache-coherent …