.png){kind=icon}
.png){kind=icon}
Return
Efficient Knowledge Graph Embedding Training Framework with Multiple GPUs
.png){kind=icon}
OA
AI
DOI：10.26599/TST.2021.9010067.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 (IO) overhead between the memory and disk. For a high IO overhead between the disk and memory problem, we optimized the twice partitioning with fine-grained GPU scheduling to reduce the IO 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.
Keywords:
knowledge graph embedding
parallel algorithm
partitioning graph framework
graphics processing unit (GPU)
Journal
T
IF:
3.5
Papers:
987
Citations:
2.5K