MEGA Evolving Graph Accelerator
Chao Gao, Mahbod Afarin, Shafiur Rahman, Nael B. Abu-Ghazaleh, Rajiv Gupta
Abstract
Graph Processing is an emerging workload for applications working with unstructured data, such as social network analysis, transportation networks, bioinformatics and operations research. We examine the problem of graph analytics over evolving graphs, which are graphs that change over time. The problem is challenging because it requires evaluation of a graph query on a sequence of graph snapshots over a time window, typically to track the progression of a property over time. In this paper, we introduce MEGA, a hardware accelerator designed for efficiently evaluating queries over evolving graphs. MEGA leverages CommonGraph, a recently proposed software approach for incrementally processing evolving graphs that gains efficiency by avoiding the need to process expensive deletions by converting them into additions. MEGA supports incremental event-based streaming of edge additions as well as execution of multiple snapshots concurrently to support evolving graphs. We propose Batch-Oriented-Execution (BOE), a novel batch-update scheduling technique that activates snapshots that share batches simultaneously to achieve both computation and data reuse. We introduce optimizations that pack compatible batches together, and pipeline batch processing. To the best of our knowledge, MEGA is the first graph accelerator for evolving graphs that evaluates graph queries over multiple snapshots simultaneously. MEGA achieves 24 × -120 × speedup over CommonGraph. It also achieves speedups ranging from 4.08 × to 5.98 × over JetStream, a state-of-the-art streaming graph accelerator.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 9d95d6df-e3f6-46b6-8b47-9abe95cd20e8Cited by top-tier papers4
- Core Graph: Exploiting Edge Centrality to Speedup the Evaluation of Iterative Graph QueriesXiaolin Jiang, Mahbod Afarin, Zhijia Zhao, Nael B. Abu-Ghazaleh et al.EuroSys 2024 · 8 citations
- CogSys: Efficient and Scalable Neurosymbolic Cognition System via Algorithm-Hardware Co-DesignZishen Wan, Hanchen Yang, Ritik Raj, Che-Kai Liu et al.HPCA 2025 · 6 citations
- Efficient GPU-Centric Evolving Graph Processing at ScaleYunmo Zhang, Jiacheng Huang, Xizhe Yin, Junqiao Qiu et al.OSDI 2026
- AutoGNN: End-to-End Hardware-Driven Graph Preprocessing for Enhanced GNN PerformanceSeungkwan Kang, Seungjun Lee, Donghyun Gouk, Miryeong Kwon et al.HPCA 2026
Related papers
- CommonGraph: Graph Analytics on Evolving DataMahbod Afarin, Chao Gao, Shafiur Rahman, Nael B. Abu-Ghazaleh et al.ASPLOS 2023 · 32 citations
- JetStream: Graph Analytics on Streaming Data with Event-Driven Hardware AcceleratorShafiur Rahman, Mahbod Afarin, Nael B. Abu-Ghazaleh, Rajiv GuptaMICRO 2021 · 31 citations
- TEGRA: Efficient Ad-Hoc Analytics on Evolving GraphsAnand Padmanabha Iyer, Qifan Pu, Kishan Patel, Joseph E. Gonzalez et al.NSDI 2021
- Local Motif Clustering on Time-Evolving GraphsDongqi Fu, Dawei Zhou, Jingrui HeKDD 2020 · 40 citations
- Improving Streaming Graph Processing Performance using Input KnowledgeAbanti Basak, Zheng Qu, Jilan Lin, Alaa R. Alameldeen et al.MICRO 2021 · 20 citations
