.png){kind=icon}
返回
Online Deadline-Aware Task Dispatching and Scheduling in Edge Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2019.2961905.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we study online deadline-aware task dispatching and scheduling in edge computing. We jointly consider the management of the networking and computing resources to meet the maximum number of deadlines. We propose an online algorithm, named Dedas, which greedily schedules newly arriving tasks and considers whether to replace some existing tasks in order to make the new deadlines satisfied. We derive a non-trivial competitive ratio of Dedas theoretically, and our analysis is asymptotically tight. Besides, we implement a distributed approximation D - Dedas with a better scalability and less than 10 percent performance loss compared with the centralized algorithm Dedas. We then build DeEdge, an edge computing testbed installed with typical latency-sensitive applications such as IoT sensor monitoring and face matching. We adopt a real-world data trace from the Google cluster for large-scale emulations. Extensive testbed experiments and simulations demonstrate that the deadline miss ratio of Dedas is stable for online tasks, which is reduced by up to 60 percent compared with state-of-the-art methods. Moreover, Dedas performs well in minimizing the average task completion time.
Keyword:
Edge computing
task dispatching and scheduling
deadline-aware tasks
online algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
分享收藏Protein kinase C translocation in relation to proliferative state of C3H 10T1/2 cells.png)
FEBS Letters
OAAI
FEBS LettersIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容