.png){kind=icon}
返回
A scheduling algorithm for autonomous driving tasks on mobile edge computing servers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sysarc.2019.02.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Autonomous driving
Mobile edge computing
Task scheduling
Earliest deadline first
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容