Residential Collegefalse
Status已發表Published
Cost-Efficient Sharing Algorithms for DNN Model Serving in Mobile Edge Networks
Dai,Hao1,2; Wu,Jiashu1,2; Wang,Yang1,2; Yen,Jerome3; Zhang,Yong1,2; Xu,Chengzhong4
2023-02-22
Source PublicationIEEE Transactions on Services Computing
ISSN1939-1374
Volume16Issue:4Pages:2517-2531
Abstract

With the fast growth of mobile edge computing (MEC), the deep neural network (DNN) has gained more opportunities in application to various mobile services. Given the tremendous number of learning parameters and large model size, the DNN model is often trained in cloud center and then dispatched to end devices for inference via edge network. Therefore, maximizing the cost-efficiency of learned model dispatch in the edge network would be a critical problem for the model serving in various application contexts. To reach this goal, in this paper we focus mainly on reducing the total model dispatch cost in the edge network while maintaining the efficiency of the model inference. We first study this problem in its off-line form as a baseline where a sequence of $n$ requests can be pre-defined in advance and exploit dynamic programming techniques to obtain a fast optimal algorithm in time complexity of $O(m^{2}n)$ under a semi-homogeneous cost model in a $m$-sized network. Then, we design and implement a 2.5-competitive algorithm for its online case with a provable lower bound of 2 for any deterministic online algorithm. We verify our results through careful algorithmic analysis and validate their actual performance via a trace-based study based on a public open international mobile network dataset.

KeywordCost Efficiency Deep Neural Network Mobile Edge Computing Model Sharing Online Algorithm
DOI10.1109/TSC.2023.3247049
URLView the original
Indexed BySCIE
Language英語English
Funding ProjectResearch on Key Technologies and Platforms for Collaborative Intelligence Driven Auto-driving Cars
WOS Research AreaComputer Science
WOS SubjectComputer Science, Information Systems ; Computer Science, Software Engineering
WOS IDWOS:001045785600016
PublisherIEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1314
Scopus ID2-s2.0-85149375930
Fulltext Access
Citation statistics
Document TypeJournal article
CollectionDEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Faculty of Science and Technology
THE STATE KEY LABORATORY OF INTERNET OF THINGS FOR SMART CITY (UNIVERSITY OF MACAU)
Corresponding AuthorWang,Yang
Affiliation1.Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen 518055, China
2.University of Chinese Academy of Sciences, Beijing 100049, China
3.Department of Computer and Information Science, Faculty of Science and Technology, University of Macau, Taipa, Macau 999078, China
4.State Key Lab of IoTSc, Department of Computer Science, University of Macau, Taipa, Macau 999078, China
Recommended Citation
GB/T 7714
Dai,Hao,Wu,Jiashu,Wang,Yang,et al. Cost-Efficient Sharing Algorithms for DNN Model Serving in Mobile Edge Networks[J]. IEEE Transactions on Services Computing, 2023, 16(4), 2517-2531.
APA Dai,Hao., Wu,Jiashu., Wang,Yang., Yen,Jerome., Zhang,Yong., & Xu,Chengzhong (2023). Cost-Efficient Sharing Algorithms for DNN Model Serving in Mobile Edge Networks. IEEE Transactions on Services Computing, 16(4), 2517-2531.
MLA Dai,Hao,et al."Cost-Efficient Sharing Algorithms for DNN Model Serving in Mobile Edge Networks".IEEE Transactions on Services Computing 16.4(2023):2517-2531.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Dai,Hao]'s Articles
[Wu,Jiashu]'s Articles
[Wang,Yang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Dai,Hao]'s Articles
[Wu,Jiashu]'s Articles
[Wang,Yang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Dai,Hao]'s Articles
[Wu,Jiashu]'s Articles
[Wang,Yang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.