A Distributed Synchronous SGD Algorithm with Global Top-k Sparsification for Low Bandwidth Networks

被引:101
|
作者
Shi, Shaohuai [1 ]
Wang, Qiang [1 ]
Zhao, Kaiyong [1 ]
Tang, Zhenheng [1 ]
Wang, Yuxin [1 ]
Huang, Xiang [2 ]
Chu, Xiaowen [1 ]
机构
[1] Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Peoples R China
[2] Shenzhen Dist Block Technol Co Ltd, MassGrid Com, Shenzhen, Peoples R China
来源
2019 39TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2019) | 2019年
关键词
Deep Learning; Stochastic Gradient Descent; Distributed SGD; Gradient Communication; Top-k Sparsification; gTop-k;
D O I
10.1109/ICDCS.2019.00220
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Distributed synchronous stochastic gradient descent (S-SGD) with data parallelism has been widely used in training large-scale deep neural networks (DNNs), but it typically requires very high communication bandwidth between computational workers (e.g., GPUs) to exchange gradients iteratively. Recently, Top-k sparsification techniques have been proposed to reduce the volume of data to be exchanged among workers and thus alleviate the network pressure. Top-k sparsification can zero-out a significant portion of gradients without impacting the model convergence. However, the sparse gradients should be transferred with their indices, and the irregular indices make the sparse gradients aggregation difficult. Current methods that use AllGather to accumulate the sparse gradients have a communication complexity of O(kP), where P is the number of workers, which is inefficient on low bandwidth networks with a large number of workers. We observe that not all top-k gradients from P workers are needed for the model update, and therefore we propose a novel global Top-k (gTop-k) sparsification mechanism to address the difficulty of aggregating sparse gradients. Specifically, we choose global top-k largest absolute values of gradients from P workers, instead of accumulating all local top-k gradients to update the model in each iteration. The gradient aggregation method based on gTop-k sparsification, namely gTopKAll-Reduce, reduces the communication complexity from O(kP) to O(k log P). Through extensive experiments on different DNNs, we verify that gTop-k S-SGD has nearly consistent convergence performance with S-SGD, and it has only slight degradations on generalization performance. In terms of scaling efficiency, we evaluate gTop-k on a cluster with 32 GPU machines which are interconnected with 1 Gbps Ethernet. The experimental results show that our method achieves 2.7-12 x higher scaling efficiency than S-SGD with dense gradients and 1.1 1.7x improvement than the existing Top-k S-SGD.
引用
收藏
页码:2238 / 2247
页数:10
相关论文
共 50 条
  • [31] Efficient non-blocking top-k query processing in distributed networks
    Deng, Bo
    Jia, Yan
    Yang, Shuqiang
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 2006, 3882 : 880 - 889
  • [32] Distributed Evaluation of Top-k Temporal Joins
    Pilourdault, Julien
    Leroy, Vincent
    Amer-Yahia, Sihem
    SIGMOD'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2016, : 1027 - 1039
  • [33] Distributed top-k aggregation queries at large
    Thomas Neumann
    Matthias Bender
    Sebastian Michel
    Ralf Schenkel
    Peter Triantafillou
    Gerhard Weikum
    Distributed and Parallel Databases, 2009, 26 : 3 - 27
  • [34] Distributed top-k aggregation queries at large
    Neumann, Thomas
    Bender, Matthias
    Michel, Sebastian
    Schenkel, Ralf
    Triantafillou, Peter
    Weikum, Gerhard
    DISTRIBUTED AND PARALLEL DATABASES, 2009, 26 (01) : 3 - 27
  • [35] ALPS: an efficient algorithm for top-k spatial preference search in road networks
    Hyung-Ju Cho
    Se Jin Kwon
    Tae-Sun Chung
    Knowledge and Information Systems, 2015, 42 : 599 - 631
  • [36] A New Global Pooling Method for Deep Neural Networks: Global Average of Top-K Max
    Dogan, Yahya
    TRAITEMENT DU SIGNAL, 2023, 40 (02) : 577 - 587
  • [37] An Exact Top-k Query Algorithm with Privacy Protection in Wireless Sensor Networks
    Huang Haiping
    Feng Juan
    Wang Ruchuan
    Qin XiaoLin
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2014,
  • [38] ALPS: an efficient algorithm for top-k spatial preference search in road networks
    Cho, Hyung-Ju
    Kwon, Se Jin
    Chung, Tae-Sun
    KNOWLEDGE AND INFORMATION SYSTEMS, 2015, 42 (03) : 599 - 631
  • [39] Top-k monitoring in wireless sensor networks
    Wu, Minji
    Xu, Jianliang
    Tang, Xueyan
    Lee, Wang-Chien
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (07) : 962 - 976
  • [40] Identifying Top-K Influential Nodes in Networks
    Mumtaz, Sara
    Wang, Xiaoyang
    CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 2219 - 2222