Real-time task dispatching and scheduling in serverless edge computing

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ming Li , Furong Xu , Yuqin Wu , Jianshan Zhang , Weitao Xu , Yuezhong Wu
{"title":"Real-time task dispatching and scheduling in serverless edge computing","authors":"Ming Li ,&nbsp;Furong Xu ,&nbsp;Yuqin Wu ,&nbsp;Jianshan Zhang ,&nbsp;Weitao Xu ,&nbsp;Yuezhong Wu","doi":"10.1016/j.adhoc.2025.103854","DOIUrl":null,"url":null,"abstract":"<div><div>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<span><math><mo>∼</mo></math></span>41.87% and achieve the lowest cold start rate compared to existing methods.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"174 ","pages":"Article 103854"},"PeriodicalIF":4.4000,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870525001027","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

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.5741.87% and achieve the lowest cold start rate compared to existing methods.
无服务器边缘计算中的实时任务派遣和调度
边缘计算使计算资源更接近物联网(IoT)设备,大大减少了传输延迟和带宽使用。然而,边缘服务器的资源有限,需要进行有效管理。无服务器计算通过弹性资源调配满足了这一需求,从而导致了无服务器边缘计算的出现--这是一种前景广阔的计算模式。尽管无服务器边缘计算潜力巨大,但在高度复杂多变的环境中进行实时任务调度和调度却面临着巨大挑战。一方面,任务执行不仅需要充足的 CPU 资源,还需要空闲的容器;另一方面,任务通常是事件驱动的,具有很强的突发性和高并发性,对快速决策提出了严格的要求。为了应对这些挑战,我们提出了一种实时任务调度和调度方法,旨在最大限度地满足任务的服务水平目标(SLO)。首先,我们设计了一种名为自适应深度强化学习(ADRL)的任务调度算法。该算法能根据粗信息快速决定任务的执行位置,并有效适应动态环境中可用服务器的变化。其次,我们提出了一种名为 "暖感知最短剩余空闲时间(WSRIT)"的任务调度算法,该算法根据任务的剩余空闲时间和暖容器的状态来指导边缘服务器调度请求队列中的任务。考虑到边缘服务器的存储空间有限,我们进一步引入了一种名为 "低优先级优先"(LPF)的容器替换算法,以确保容器的顺利启动。我们基于 Azure 数据集进行了广泛的模拟实验。结果表明,与现有方法相比,我们的方法能将 SLO 的满足率提高 12.57∼41.87% 并实现最低的冷启动率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信