Dependent Task Scheduling for Multiple Applications in Mobile Edge Computing

Mobile Edge Computing (MEC) offers computational services near data sources to meet numerous real-time data processing demands of end devices. Scheduling dependent tasks in resource-constrained environments is a key research focus in MEC, aimed at enhancing the completion rates of applications within their deadlines. However, most existing works overlook the resource competition among requests arriving at different times, leading to decreased application completion rates. In this paper, we propose a dependent task online scheduling approach for multiple applications to optimize application completion rates. For multiple applications with deadline constraints, where tasks within each application may have dependencies, we propose a multi-priority task sequencing algorithm to determine the execution order of tasks. To accommodate scenarios where requests arrive at different times, we introduce a priority-based queue to dynamically adjust task execution order based on urgency and resource demands. Finally, by comparing with baseline approaches, experimental results demonstrate that our approach can improve the application completion rate by approximately 41.02%, demonstrating its effectiveness.

Authors

Institutions

Publication Details

Published
2025-03-24
DOI
https://doi.org/10.1109/wcnc61545.2025.10978338
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dependent Task Scheduling for Multiple Applications in Mobile Edge Computing

Cheng Qian, Y. Ye, Gansen Zhao
1 links
Cloud Computing and Resource Management
article

Dependent Task Scheduling for Multiple Applications in Mobile Edge Computing

Cheng Qian, Y. Ye, Gansen Zhao
article en

Abstract

Mobile Edge Computing (MEC) offers computational services near data sources to meet numerous real-time data processing demands of end devices. Scheduling dependent tasks in resource-constrained environments is a key research focus in MEC, aimed at enhancing the completion rates of applications within their deadlines. However, most existing works overlook the resource competition among requests arriving at different times, leading to decreased application completion rates. In this paper, we propose a dependent task online scheduling approach for multiple applications to optimize application completion rates. For multiple applications with deadline constraints, where tasks within each application may have dependencies, we propose a multi-priority task sequencing algorithm to determine the execution order of tasks. To accommodate scenarios where requests arrive at different times, we introduce a priority-based queue to dynamically adjust task execution order based on urgency and resource demands. Finally, by comparing with baseline approaches, experimental results demonstrate that our approach can improve the application completion rate by approximately 41.02%, demonstrating its effectiveness.

South China Normal University (CN)
National Science Foundation
Openalex Percentile: Top 86%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.