arrow
返回

UMA-MF: A Unified Multi-CPU/GPU Asynchronous Computing Framework for SGD-Based Matrix Factorization

delete2023-11-01
delete0
PRE
AI
Y
Yizhi Huang
刘彦 封面图
刘彦 (Yan Liu) *
Y
Yang Bai
S
Si Chen
李仁发 封面图
李仁发 (Renfa Li)
DOI:10.1109/TPDS.2023.3317535delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Recent research has shown that collaborative computing of CPUs and GPUs in the same system can effectively accelerate large-scale SGD-based matrix factorization (MF), but it faces the problem of limited scalability due to parameter synchronization in the server. Theoretically, asynchronous methods can overcome this shortcoming. However, through a series of tests, observations, and analyses, we realize that developing an effective asynchronous multi-CPU/GPU MF framework faces several major design challenges: the underutilized CPUs, high communication overhead, and the asynchronous data safety issue. This article presents a unified multi-CPU/GPU asynchronous computing framework for SGD-based matrix factorization, named UMA-MF. UMA-MF treats CPUs and GPUs in the system as distributed workers that train matrix datasets in parallel and update feature parameters asynchronously. It provides a cache-friendly CPU external working mode, which can improve the CPU's cache hit rate, thereby promoting the efficient use of CPUs. It offers an algorithm to find the shortest communication ring topology of heterogeneous CPU/GPU workers and builds computing-communication pipelines to minimize the communication overhead. It implements a wait-free structure and load-balanced data distribution to achieve asynchronous data safety. UMA-MF can effectively accelerate SGD-based MF on multi-CPU/GPU systems in an asynchronous way. On a physical platform with configurations ranging from single processor system to 2CPUs--4CPUs system, for five common datasets Netfix, R1, R2, Goodreads, and de-dense, UMA-MF achieves up to 3.56x speedup compared with HCC-MF, which is the state-of-the-art multi-CPU/GPU synchronous computing framework for SGD-based MF. UMA-MF also shows good scalability. When the system is scaled to 2CPUs-4GPUs, the training time speedup of UMA-MF can reach 70%--97% of the ideal speedup.
Keyword:
Matrix factorization
multi-CPU/GPU
parallel systems
stochastic gradient descent

期刊

IEEE Transactions on Parallel and Distributed Systems 封面图
IEEE Transactions on Parallel and Distributed Systems
IF:
6
论文数:
5.2K
被引数:
1.1W

机构

H
hunan university
学者数:
4.5W
论文数: 3.3W
被引数: 70
引用论文

引用论文

Measuring Highway Impacts on House Prices Using Spatial Regression
err2020-08-04
err0
errOAAI
errMarcus T. Allen; Grant W. Austin; Mushfiq Swaleheen
err分享
err收藏
err分享
err收藏
Graph Regularized Lp Smooth Non-negative Matrix Factorization for Data Representation
err2019-03-01
err63
PREAI
errLeng, Chengcai; Zhang, Hai; Cai, Guorong; Cheng, Irene; Basu, Anup
err分享
err收藏
A Thermodynamic Description of the Al-Ir System
err2007-03-15
err0
PREAI
errTaichi Abe; Machiko Ode; Hideyuki Murakami; Chang Seok Oh; Cenk Kocer; Yoko Yamabe-Mitarai; Hidehiro Onodera
err分享
err收藏
学者 查看更多内容