2019
DOI: 10.1007/s10617-019-09222-5
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of multitask parallel mobile edge computing strategy based on deep learning architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…To clarify the scheduling problem in the cloud computing environment, the task scheduling problem in the cloud computing environment can be described as follows: in the cloud computing environment, n independent subtasks are assigned to M VM nodes for execution [12]. Where task set T = fsubtask 1 , subtask 2 , subtask 3 , ⋯, subtask n g and VM resource node VM = fvm 1 , vm 2 , ⋯, vm m g, subtask j ðj = 1, 2, ⋯, nÞ represent the JTH task, and VM i ði = 1, 2, ⋯, mÞ represent the ith VM resource.…”
Section: Description Of Task Scheduling Problems In Cloudmentioning
confidence: 99%
“…To clarify the scheduling problem in the cloud computing environment, the task scheduling problem in the cloud computing environment can be described as follows: in the cloud computing environment, n independent subtasks are assigned to M VM nodes for execution [12]. Where task set T = fsubtask 1 , subtask 2 , subtask 3 , ⋯, subtask n g and VM resource node VM = fvm 1 , vm 2 , ⋯, vm m g, subtask j ðj = 1, 2, ⋯, nÞ represent the JTH task, and VM i ði = 1, 2, ⋯, mÞ represent the ith VM resource.…”
Section: Description Of Task Scheduling Problems In Cloudmentioning
confidence: 99%
“…In [33], a partitioned fixed-priority real-time scheduling based on dependent tasks split on homogeneous multicore platform was proposed, which converted dependent tasks into a series of sequential jobs and obtained the interrelated subtasks path as well as synthetic deadlines through the B-tree task model. In [34], the authors creatively proposed a deep learning architecture based on tightly connected network and proposed a corresponding multitask parallel scheduling algorithm. In [35], a peer-to-peer (P2P) enhanced task scheduling framework to minimize the average task duration in device-to-device (D2D) network was proposed.…”
Section: Related Workmentioning
confidence: 99%
“…Obviously, these factors also have a great impact on the efficiency of subsequent task scheduling. Although papers [31][32][33][34][35] focus on these two factors to optimize the task offloading process, they are not considered as a whole. However, task slicing is closely related to its offloading sequence, and different slicing schemes should correspond to different offloading sequence to optimize the execution delay of the task to the maximum extent.…”
Section: Related Workmentioning
confidence: 99%
“…The combination of cloud server and edge device can provide more reliable services to users on the edge. Liu et al [4] proposed a deep learning architecture based on the close connection network, transplanted it into the mobile edge algorithm, and found through the simulation that the algorithm had obvious overall efficiency advantage. Zhang et al [5] proposed the weight based algorithm and mobile prediction based heuristic algorithm for users with certain and uncertain mobile tracks to reduce the network overhead caused by task migration and found through experiments that the two algorithms could effectively reduce the network overhead caused by task migration.…”
Section: Introductionmentioning
confidence: 99%