paper-with-me

홈 › Papers

SmartSAGE: Training Large-scale Graph Neural Networks using In-Storage Processing Architectures

2022-05-10 · Yunjae Lee, Jinha Chung, Minsoo Rhu

Graph neural networks (GNNs) can extract features by learning both the representation of each objects (i.e., graph nodes) and the relationship across different objects (i.e., the edges that connect nodes), achieving state-of-the-art performance in various graph-based tasks. Despite its strengths, utilizing these algorithms in a production environment faces several challenges as the number of graph nodes and edges amount to several billions to hundreds of billions scale, requiring substantial storage space for training. Unfortunately, state-of-the-art ML frameworks employ an in-memory processing model which significantly hampers the productivity of ML practitioners as it mandates the overall working set to fit within DRAM capacity. In this work, we first conduct a detailed characterization on a state-of-the-art, large-scale GNN training algorithm, GraphSAGE. Based on the characterization, we then explore the feasibility of utilizing capacity-optimized NVM SSDs for storing memory-hungry GNN data, which enables large-scale GNN training beyond the limits of main memory size. Given the large performance gap between DRAM and SSD, however, blindly utilizing SSDs as a direct substitute for DRAM leads to significant performance loss. We therefore develop SmartSAGE, our software/hardware co-design based on an in-storage processing (ISP) architecture. Our work demonstrates that an ISP based large-scale GNN training system can achieve both high capacity storage and high performance, opening up opportunities for ML practitioners to train large GNN datasets without being hampered by the physical limitations of main memory size.

📄 PDF Abstract BibTeX arXiv:2205.04711

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Non Maximum Suppression Non Maximum Suppression is a computer vision method that selects a single entity out of many overlapping entities (for example bounding boxes in object detection). The…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
GraphSAGE GraphSAGE is a general inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
SSD SSD is a single-stage object detection method that discretizes the output space of bounding boxes into a set of default boxes over different aspect ratios and scales per…

Similar Papers 제목 키워드 기반

Accelerating Storage-Based Training for Graph Neural Networks

2026-01-04 · Myung-Hwan Jang, Jeong-Min Park, Yunyong Ko, Sang-Wook Kim arxiv

Graph neural networks (GNNs) have achieved breakthroughs in various real-world downstream tasks due to their powerful expressiveness. As the scale of real-world graphs has been continuously growing, a storage-based appro…

LSM-GNN: Large-scale Storage-based Multi-GPU GNN Training by Optimizing Data Transfer Scheme

2024-07-21 · Jeongmin Brian Park, Kun Wu, Vikram Sharma Mailthody, Zaid Quresh 외

Graph Neural Networks (GNNs) are widely used today in recommendation systems, fraud detection, and node/link classification tasks. Real world GNNs continue to scale in size and require a large memory footprint for storin…

CPUFraud DetectionGPUgraph partitioning+1

Accelerating Sampling and Aggregation Operations in GNN Frameworks with GPU Initiated Direct Storage Accesses

2023-06-28 · Jeongmin Brian Park, Vikram Sharma Mailthody, Zaid Qureshi, Wen-mei Hwu

Graph Neural Networks (GNNs) are emerging as a powerful tool for learning from graph-structured data and performing sophisticated inference tasks in various application domains. Although GNNs have been shown to be effect…

CPUGPUGraph Sampling

Accelerating Large-Scale Graph-based Nearest Neighbor Search on a Computational Storage Platform

2022-07-12 · Ji-Hoon Kim, Yeo-Reum Park, Jaeyoung Do, Soo-Young Ji 외

K-nearest neighbor search is one of the fundamental tasks in various applications and the hierarchical navigable small world (HNSW) has recently drawn attention in large-scale cloud services, as it easily scales up the d…

CPUGPU

GraphGen+: Advancing Distributed Subgraph Generation and Graph Learning On Industrial Graphs

2025-03-08 · Yue Jin, Yongchao Liu, Chuntao Hong

Graph-based computations are crucial in a wide range of applications, where graphs can scale to trillions of edges. To enable efficient training on such large graphs, mini-batch subgraph sampling is commonly used, which …

Graph Learning