{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:22Z","timestamp":1740142762340,"version":"3.37.3"},"reference-count":32,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072118","62106052"],"award-info":[{"award-number":["62072118","62106052"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,3,15]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Parameter servers (PSs) placement is one of the most important factors for global model training on distributed deep learning. This paper formulates a novel problem for placement strategy of PSs in the dynamic available storage capacity, with the objective of minimizing the training time of the distributed deep learning under the constraints of storage capacity and the number of local PSs. Then, we provide the proof for the NP-hardness of the proposed problem. The whole training epochs are divided into two parts, i.e. the first epoch and the other epochs. For the first epoch, an approximation algorithm and a rounding algorithm are proposed in this paper, to solve the proposed problem. For the other epochs, an adjustment algorithm is proposed, by continuously adjusting the decisions for placement strategy of PSs to decrease the training time of the global model. Simulation results show that the proposed approximation algorithm and rounding algorithm perform better than existing works for all cases, in terms of the training time of global model. Meanwhile, the training time of global model for the proposed approximation algorithm is very close to that for optimal solution generated by the brute-force approach for all cases. Besides, the integrated algorithm outperforms the existing works when the available storage capacity varies during the training.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab188","type":"journal-article","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T12:16:44Z","timestamp":1636546604000},"page":"678-691","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Parameter Server Placement for Distributed Deep Learning in Edge Computing"],"prefix":"10.1093","volume":"66","author":[{"given":"Yalan","family":"Wu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology , Guangdong University of Technology, Guangzhou, China , 510006"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaquan","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology , Guangdong University of Technology, Guangzhou, China , 510006"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology , Guangdong University of Technology, Guangzhou, China , 510006"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology , Guangdong University of Technology, Guangzhou, China , 510006"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yidong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology , Beijing Jiaotong University, Beijing, China , 100044"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"volume-title":"Data age 2025: the digitization of the world from edge to core","year":"2018","author":"Reinsel","key":"2023031708554037100_"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"5017","DOI":"10.1109\/TIP.2015.2475625","article-title":"PCANet: A simple deep learning baseline for image classification","volume":"24","author":"Chan","year":"2015","journal-title":"IEEE Transactions on Image Processing"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1093\/nsr\/nwx110","article-title":"Deep learning for natural language processing: advantages and challenges","volume":"5","author":"Li","year":"2018","journal-title":"National Science Review"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","article-title":"Human-level control through deep reinforcement learning","volume":"518","author":"Mnih","year":"2015","journal-title":"Nature"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","article-title":"Deep learning","volume":"521","author":"LeCun","year":"2015","journal-title":"Nature"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1145\/1951365.1951432","volume-title":"International Conference on Extending Database Technology","author":"Agrawal","year":"2011"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/JIOT.2016.2579198","article-title":"Edge computing: Vision and challenges","volume":"3","author":"Shi","year":"2016","journal-title":"IEEE Internet of Things Journal"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"3864","DOI":"10.1109\/JIOT.2019.2892398","article-title":"Adaptive service offloading for revenue maximization in mobile edge computing with delay-constraint","volume":"6","author":"Samanta","year":"2019","journal-title":"IEEE Internet of Things Journal"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"4755","DOI":"10.1109\/JIOT.2018.2874473","article-title":"Privacy preserving data aggregation scheme for mobile edge computing assisted IoT applications","volume":"6","author":"Li","year":"2018","journal-title":"IEEE Internet of Things Journal"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1109\/JPROC.2019.2921977","article-title":"Deep learning with edge computing: A review","volume":"107","author":"Chen","year":"2019","journal-title":"Proceedings of the IEEE"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1109\/JSAC.2019.2904348","article-title":"Adaptive federated learning in resource constrained edge computing systems","volume":"37","author":"Wang","year":"2019","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"2022","DOI":"10.1109\/TWC.2019.2961673","article-title":"Federated learning via over-the-air computation","volume":"19","author":"Yang","year":"2020","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"3400","DOI":"10.1109\/TNNLS.2019.2944481","article-title":"Robust and communication-efficient federated learning from non-i.i.d. data","volume":"31","author":"Sattler","year":"2020","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"2023031708554037100_","first-page":"1","volume-title":"Distributed deep learning model for intelligent video surveillance systems with edge computing","author":"Chen","year":"2019"},{"key":"2023031708554037100_","first-page":"12","volume-title":"Balancing stragglers against staleness in distributed deep learning","author":"Basu","year":"2018"},{"key":"2023031708554037100_","first-page":"532","volume-title":"Round-robin synchronization: Mitigating communication bottlenecks in parameter servers","author":"Chen","year":"2019"},{"key":"2023031708554037100_","first-page":"181","volume-title":"USENIX Annual Technical Conference","author":"Zhang","year":"2017"},{"key":"2023031708554037100_","first-page":"172","volume-title":"IEEE Conference on Computer Communications","author":"Shi","year":"2019"},{"key":"2023031708554037100_","first-page":"1387","volume-title":"IEEE Conference on Computer Communications","author":"Tran","year":"2019"},{"key":"2023031708554037100_","first-page":"171","volume-title":"IEEE International Conference on Data Mining","author":"Gupta","year":"2016"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"6535","DOI":"10.1109\/TWC.2020.3003744","article-title":"HFEL: Joint edge association and resource allocation for cost-efficient hierarchical federated edge learning","volume":"19","author":"Luo","year":"2020","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"2866","DOI":"10.1109\/TPDS.2015.2510638","article-title":"Efficient algorithms for capacitated cloudlet placements","volume":"27","author":"Xu","year":"2016","journal-title":"IEEE Transactions on Parallel Distributed System"},{"key":"2023031708554037100_","first-page":"1459","volume-title":"IEEE Conference on Computer Communications","author":"Gao","year":"2019"},{"key":"2023031708554037100_","first-page":"207","volume-title":"IEEE Conference on Computer Communications","author":"Xu","year":"2018"},{"key":"2023031708554037100_","first-page":"468","volume-title":"IEEE Conference on Computer Communications","author":"Wang","year":"2018"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","article-title":"Gradient-based learning applied to document recognition","volume":"86","author":"LeCun","year":"1998","journal-title":"Proceedings of the IEEE"},{"key":"2023031708554037100_","first-page":"734","volume-title":"International Conference on High Performance Computing and Communications","author":"Wang","year":"2019"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","article-title":"A best possible heuristic for the k-center problem","volume":"10","author":"Hochbaum","year":"1985","journal-title":"Mathematics of Operations Research"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2004.08.010","article-title":"k-center problems with minimum coverage","volume":"332","author":"Lim","year":"2005","journal-title":"Theoretical Computer Science"},{"volume-title":"Computers and Intracdtability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey","key":"2023031708554037100_"},{"key":"2023031708554037100_","first-page":"1","volume-title":"International Conference on Integer Programming and Combinatorial Optimization","author":"Archer","year":"2001"},{"key":"2023031708554037100_","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1109\/TCSS.2020.2997188","article-title":"Activity minimization of misinformation influence in online social networks","volume":"7","author":"Zhu","year":"2020","journal-title":"IEEE Transactions on Computational Social Systems"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/3\/678\/49530919\/bxab188.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/3\/678\/49530919\/bxab188.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T12:57:26Z","timestamp":1699793846000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/3\/678\/6446972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,1]]},"references-count":32,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,12,1]]},"published-print":{"date-parts":[[2023,3,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab188","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,3]]},"published":{"date-parts":[[2021,12,1]]}}}