Efficient Graph Embedding at Scale: Optimizing CPU-GPU-SSD Integration
Zhonggen Li, Xiangyu Ke, Yifan Zhu, Yunjun Gao, Feifei Li

TL;DR
Legend is a scalable graph embedding system that optimizes CPU-GPU-SSD data management, enabling billion-scale embeddings with high efficiency and significantly reduced hardware requirements.
Contribution
The paper introduces Legend, a novel heterogeneous system that redesigns data management for graph embedding, combining prefetching, direct SSD access, and parallel execution to improve scalability and efficiency.
Findings
Speeds up workloads by up to 4.8x compared to state-of-the-art
Uses only one quarter of the GPUs needed by existing systems
Handles billion-scale graphs without I/O stalls or excessive memory use
Abstract
Graph embeddings map graph nodes to continuous vectors and are foundational to community detection, recommendation, and many scientific applications. At billion-scale, however, existing graph embedding systems face a trade-off: they either rely on large in-memory footprints across many GPUs (limited scalability) or repeatedly stream data from disk (incurring severe I/O overhead and low GPU utilization). In this paper, we propose Legend, a lightweight heterogeneous system for graph embedding that systematically redesigns data management across CPU, GPU, and NVMe SSD resources. Legend combines three practical ideas: (1) a prefetch-friendly embedding-loading order that lets GPUs efficiently prefetch necessary embeddings directly from NVMe SSD with low I/O amplification; (2) a high-throughput GPU-SSD direct-access driver tuned for the access patterns of embedding training; and (3) a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms
