4.6 Article

A scheduling algorithm for autonomous driving tasks on mobile edge computing servers

期刊

JOURNAL OF SYSTEMS ARCHITECTURE
卷 94, 期 -, 页码 14-23

出版社

ELSEVIER SCIENCE BV
DOI: 10.1016/j.sysarc.2019.02.004

关键词

Autonomous driving; Mobile edge computing; Task scheduling; Earliest deadline first

资金

  1. Independent Innovation Engineering of Shandong Province [2017CXGC0703]
  2. Science & Technology Development Program of Shandong Province [2017GGX10148]

向作者/读者索取更多资源

Autonomous driving has received widespread attention in recent years, while the limited battery life and computing capability of autonomous vehicles cannot support some necessary computation-intensive and urgent tasks with strict response time requirements. The results of the tasks would be useless and may cause serious safety hazards if the given time constraints are exceeded. On the other side, mobile edge computing (MEC) offers the possibility of autonomous vehicles to complete these time-constraint tasks due to its proximity and strong computing capabilities, with the faster 5G wireless networks to enable vehicles and MEC servers to exchange data in milliseconds. Then, it is a key issue to make the MEC servers to execute and complete these time-constraint autonomous-driving tasks as many as possible. So, we propose a task scheduling algorithm that can consider characteristics of autonomous-driving tasks and select more suitable MEC servers with task migration, based on an improved earliest deadline first algorithm through the replacement and recombination of tasks. From the experimental results, it can be concluded that the algorithm can schedule more tasks and benefit the urgent tasks effectively with the increase of the task amounts.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据