Real-time task dispatching and scheduling in serverless edge computing

Edge computing brings computing resources closer to the Internet of Things (IoT) devices, significantly reducing transmission latency and bandwidth usage. However, the limited resources of edge servers require efficient management. Serverless computing meets this demand through its elastic resource provisioning , leading to the emergence of serverless edge computing—a promising computing paradigm . Despite its potential, real-time task dispatching and scheduling in the highly complex and dynamic environment of serverless edge computing present significant challenges. On the one hand, task execution requires not only sufficient CPU resources but also free containers; on the other hand, tasks are typically event-driven, with strong burstiness and high concurrency, and impose stringent demands on fast decision-making. To address these challenges, we propose a real-time task dispatching and scheduling method, aiming to maximize the satisfaction rate of Service Level Objectives (SLOs) for tasks. First, we design a task dispatching algorithm named Adaptive Deep Reinforcement Learning (ADRL). This algorithm can quickly decide the execution position of tasks based on coarse information and effectively adapt to the changes in available servers in dynamic environments. Second, we propose a task scheduling algorithm named Warm-aware Shortest Remaining Idle Time (WSRIT), which guides the edge servers to schedule the tasks in the request queue based on the tasks’ remaining idle time and the state of the warm containers. Considering the limited storage space of the edge servers, we further introduce a container replacement algorithm named Low Priority First (LPF) to ensure smooth container launches. Extensive simulation experiments are conducted based on Azure datasets. The results show that our methodcan improve the satisfaction rate of SLOs by 12.57 ∼ 41.87% and achieve the lowest cold start rate compared to existing methods.

Authors

Institutions

Publication Details

Journal
Ad Hoc Networks
Published
2025-04-09
DOI
https://doi.org/10.1016/j.adhoc.2025.103854
Citations
2
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
2.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Real-time task dispatching and scheduling in serverless edge computing

Ming Li, Yuqin Wu, Jianshan Zhang, Weitao Xu et al.
2 citations
Ad Hoc Networks
Distributed and Parallel Computing Systems
2.97
article

Real-time task dispatching and scheduling in serverless edge computing

Ming Li, Yuqin Wu, Jianshan Zhang, Weitao Xu, Furong Xu, Yuezhong Wu
article en
2 citations

Abstract

Edge computing brings computing resources closer to the Internet of Things (IoT) devices, significantly reducing transmission latency and bandwidth usage. However, the limited resources of edge servers require efficient management. Serverless computing meets this demand through its elastic resource provisioning , leading to the emergence of serverless edge computing—a promising computing paradigm . Despite its potential, real-time task dispatching and scheduling in the highly complex and dynamic environment of serverless edge computing present significant challenges. On the one hand, task execution requires not only sufficient CPU resources but also free containers; on the other hand, tasks are typically event-driven, with strong burstiness and high concurrency, and impose stringent demands on fast decision-making. To address these challenges, we propose a real-time task dispatching and scheduling method, aiming to maximize the satisfaction rate of Service Level Objectives (SLOs) for tasks. First, we design a task dispatching algorithm named Adaptive Deep Reinforcement Learning (ADRL). This algorithm can quickly decide the execution position of tasks based on coarse information and effectively adapt to the changes in available servers in dynamic environments. Second, we propose a task scheduling algorithm named Warm-aware Shortest Remaining Idle Time (WSRIT), which guides the edge servers to schedule the tasks in the request queue based on the tasks’ remaining idle time and the state of the warm containers. Considering the limited storage space of the edge servers, we further introduce a container replacement algorithm named Low Priority First (LPF) to ensure smooth container launches. Extensive simulation experiments are conducted based on Azure datasets. The results show that our methodcan improve the satisfaction rate of SLOs by 12.57 ∼ 41.87% and achieve the lowest cold start rate compared to existing methods.

Ad Hoc NetworksVol. 174
City University of Hong Kong (HK), Minjiang University (CN), Fujian Institute of Education (CN), Ningde Normal University (CN), Fuzhou University (CN)
Openalex Percentile: Top 9%
Distributed and Parallel Computing Systems
2.97
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.