Understanding the Implication of Non-Volatile Memory for Large-Scale Graph Neural Network Training

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 236
  • Download : 0
Graph neural networks (GNNs) can extract features by learning both the representation of each objects (i.e., graph nodes) as well as the relationship across different objects (i.e., the edges that connect nodes), achieving state-of-the-art performance on a wide range of graph-based tasks. Despite its strengths, utilizing these algorithms in a production environment faces several key 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, existing ML frameworks based on the in-memory processing model significantly hamper the productivity of algorithm developers as it mandates the overall working set to fit within DRAM capacity constraints. In this work, we first study state-of-the-art, large-scale GNN training algorithms. We then conduct a detailed characterization on utilizing capacity-optimized non-volatile memory solutions for storing memory-hungry GNN data, exploring the feasibility of SSDs for large-scale GNN training.
Publisher
IEEE COMPUTER SOCIETY
Issue Date
2021-07
Language
English
Article Type
Article
Citation

IEEE COMPUTER ARCHITECTURE LETTERS, v.20, no.2, pp.118 - 121

ISSN
1556-6056
DOI
10.1109/LCA.2021.3098943
URI
http://hdl.handle.net/10203/287866
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0