Efficient Knowledge Graph Embedding Training Framework with Multiple GPUs

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

When training a large-scale knowledge graph embedding (KGE) model with multiple graphics processing units (GPUs), the partition-based method is necessary for parallel training. However, existing partition-based training methods suffer from low GPU utilization and high input/output (10) overhead between the memory and disk. For a high 10 overhead between the disk and memory problem, we optimized the twice partitioning with fine-grained GPU scheduling to reduce the 10 overhead between the CPU memory and disk. For low GPU utilization caused by the GPU load imbalance problem, we proposed balanced partitioning and dynamic scheduling methods to accelerate the training speed in different cases. With the above methods, we proposed fine-grained partitioning KGE, an efficient KGE training framework with multiple GPUs. We conducted experiments on some benchmarks of the knowledge graph, and the results show that our method achieves speedup compared to existing framework on the training of KGE.

Cite

CITATION STYLE

APA

Sun, D., Huang, Z., Li, D., & Guo, M. (2023). Efficient Knowledge Graph Embedding Training Framework with Multiple GPUs. Tsinghua Science and Technology, 28(1), 167–175. https://doi.org/10.26599/TST.2021.9010067

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free