GraphService: Topology-aware Constructor for Large-scale Graph Applications
ACM Transactions on Architecture and Code Optimization · 31.03.2025 · 22 (1) · 1-24
DOI: 10.1145/3689341 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Architecture and Code Optimization, online erschienen am 22.03.2025. Verfasst von Xinbiao Gan. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 73 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, PDL Innovation Research Fund, China’s National Key Research and Development Program.
Abstract (Originalsprache)
Graph-based services are becoming integrated into everyday life through graph applications and graph learning systems. While traditional graph processing approaches boast excellent throughput with millisecond-level processing time, the construction phase before executing kernel graph operators (e.g., breadth-first search, single-source shortest path) can take up to tens of hours, severely impacting the quality of graph service. Is it feasible to develop a fast graph constructor that can complete the construction process within minutes, or even seconds? This article aims to answer this question. We present GraphService , a flexible and efficient graph constructor for fast graph applications. To facilitate graph applications with better service, we equip GraphService with a hierarchy-aware graph partitioner based on communication topology as well as a graph topology-aware compression by exploiting a huge number of identical-degree vertices within graph topology. Our evaluation, performed on a range of graph operations and datasets, shows that GraphService significantly reduces communication cost by three orders of magnitude to construct a graph. Furthermore, we tailor GraphService for downstream graph tasks and deploy it on a production supercomputer using 79,024 computing nodes, achieving a remarkable graph processing throughput that outperforms the top-ranked supercomputer on the latest Graph500 list, with construction time reduced by orders of magnitude.
Förderung
- National Natural Science Foundation of China
- PDL Innovation Research Fund
- China’s National Key Research and Development Program
Zitieren
APA
Gan, X. (2025). GraphService: Topology-aware Constructor for Large-scale Graph Applications. ACM Transactions on Architecture and Code Optimization, 22(1), 1-24. https://doi.org/10.1145/3689341
Vancouver
Gan X. GraphService: Topology-aware Constructor for Large-scale Graph Applications. ACM Transactions on Architecture and Code Optimization. 2025;22(1):1-24. doi:10.1145/3689341
BibTeX
@article{Gan2025,
author = {Gan, Xinbiao},
title = {GraphService: Topology-aware Constructor for Large-scale Graph Applications},
journal = {ACM Transactions on Architecture and Code Optimization},
year = {2025},
volume = {22},
number = {1},
pages = {1--24},
doi = {10.1145/3689341}
}
EUVIMED