Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jinduo Song

dblp:256/8775 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Edge and fog computing · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › distributed training › parallelization
model partitioning
0.812024
Hastening Stream Offloading of Inference via Multi-Exit DNNs in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2024
Edge and fog computing › mobile edge computing › computation offloading › inference offloading
DNN inference offloading
0.812024
Hastening Stream Offloading of Inference via Multi-Exit DNNs in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2024
Edge and fog computing
mobile edge computing
0.812024
Hastening Stream Offloading of Inference via Multi-Exit DNNs in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2024

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 1.5priority experience replay · 1.5dynamic programming · 1.5
YearPublicationVenuePosition
2024 Hastening Stream Offloading of Inference via Multi-Exit DNNs in Mobile Edge Computing
abstract
As the primary driver of intelligent mobile applications, deep neural networks (DNNs) have gradually deployed to millions of mobile devices, producing massive latency-sensitive and computation-intensive tasks daily. Mobile edge computing facilitates the deployment of computing resources at the edge, which enables fine-grained offloading of DNN inference tasks from mobile devices to edge nodes. However, most existing studies have not systematically considered three crucial performance aspects: scheduling multiple streams of DNN inference tasks, leveraging multi-exit models to hasten task processing, and partitioning inference models for partial offloading. To this end, this paper proposes an adaptive inference framework in mobile edge computing, which can dynamically select the exit point and partition point for multiple inference task streams. We design a dynamic programming algorithm to obtain an efficient solution under the ideal condition that task arrival information is known. Further, we design a learning-based algorithm for online scheduling, whose training efficiency is improved based on historical experience initialization and priority experience replay. Experimental results show that compared with the Greedy algorithm, the online algorithm improves the performance on two environmental parameters by an average of 5.9% and 32%, respectively.
Jinduo Song, Chao Qiu, Xiaofei Wang 0001, Xu Chen 0004, Qiang He 0001, Hao Sheng 0001
IEEE Trans. Mob. Comput.2
2021 Adaptive and Collaborative Edge Inference in Task Stream with Latency Constraint
abstract
With the rapid development of the Internet of Things (IoT), more and more smart devices are connected to the Internet, implementing Deep Neural Network (DNN) models on edges for collaborative inference via device-edge synergy has become a feasible method for improving application performance in many scenarios. However, when faced with the task stream scenario with latency guarantee such as video surveillance and industrial production line, we need adaptive edge intelligence to make adjustments in real-time according to the changes of the task stream. There are many adaptive edge intelligence technologies in the existing works, such as early-exit mechanism and model selection, but they don’t take the requirements of the task stream scenario into consideration. In this paper, we propose a device-edge collaborative inference system based on the early-exit mechanism to solve the problem of adaptive edge intelligence in the task stream scenario. Then, we design an offline dynamic programming (DP) algorithm and an online deep reinforcement learning (DRL) algorithm to dynamically select the exit point and partition point of the branchy model in the task stream, which aims to balance the number of tasks accomplished and task inference accuracy in the system. Experimental results show that the DRL algorithm can achieve performance close to that of the DP algorithm in the task stream scenario.
Jinduo Song, Xiaofei Wang 0001, Chao Qiu, Xu Chen 0004
ICC1