<p>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 <Emphasis FontCategory="SansSerif">Legend</Emphasis>, a <Emphasis Type="Underline">l</Emphasis>ightweight h<Emphasis Type="Underline">e</Emphasis>te- ro<Emphasis Type="Underline">g</Emphasis> <Emphasis Type="Underline">en</Emphasis>eous system for graph embe<Emphasis Type="Underline">d</Emphasis>ding that systematically redesigns data management across CPU, GPU, and NVMe SSD resources. <Emphasis FontCategory="SansSerif">Legend</Emphasis> 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 customized parallel execution strategy that maximizes GPU utilization. Together, these components let <Emphasis FontCategory="SansSerif">Legend</Emphasis> store and stream vast embedding data without overprovisioning GPU memory or suffering I/O stalls. Extensive experiments on billion-scale graphs demonstrate that <Emphasis FontCategory="SansSerif">Legend</Emphasis> speeds up end-to-end workloads by up to 4.8<InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\times \)</EquationSource> <EquationSource Format="MATHML"><math> <mo>×</mo> </math></EquationSource> </InlineEquation> versus state-of-the-art systems, and matches their performance on the largest workloads while using only one quarter of the GPUs.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Efficient graph embedding at scale: optimizing CPU-GPU-SSD integration

  • Zhonggen Li,
  • Xiangyu Ke,
  • Yifan Zhu,
  • Yunjun Gao,
  • Feifei Li

摘要

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 hete- rog eneous 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 customized parallel execution strategy that maximizes GPU utilization. Together, these components let Legend store and stream vast embedding data without overprovisioning GPU memory or suffering I/O stalls. Extensive experiments on billion-scale graphs demonstrate that Legend speeds up end-to-end workloads by up to 4.8 \(\times \) × versus state-of-the-art systems, and matches their performance on the largest workloads while using only one quarter of the GPUs.