|
个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职：Director of Academic Committee at Kaifa District
其他任职：开发区校区学术分委员会主任（Director of Academic Committee at Kaifa Campus）
性别：男
毕业院校：多伦多大学
学位：博士
所在单位：软件学院、国际信息与软件学院
学科：软件工程. 运筹学与控制论
办公地点：开发区（Kaifa District Campus）
联系方式：mingchul@dlut.edu.cn
电子邮箱：mingchul@dlut.edu.cn
Research on Real-Time Embedded Software Scheduling Model Based on EDF
点击次数：
论文类型：期刊论文
发表时间：2020-01-01
发表刊物：IEEE ACCESS
收录刊物：EI、SCIE
卷号：8
页面范围：20058-20066
ISSN号：2169-3536
关键字：Deadline; real-time scheduling; EDF (earliest deadline first) algorithm
摘要：Schedulability analysis is a very important part in real-time system research. Because the scenarios faced by real-time systems are very complicated, the functional characteristics must be combined with the predictability of response time. It is necessary to ensure the correctness of the calculation results and meet the real-time requirements. To solve this problem, we propose the IEDF (Improved Earliest Deadline First) algorithm, which is combined with the queuing theory model. The IEDF algorithm is based on the EDF (Earliest Deadline First) algorithm, which is more suitable for the scheduling of real-time embedded system. Scheduling of non-periodic tasks that arrive randomly. There are two types of tasks in the task set, tasks with a high static priority are executed first. In the ready queue of the same priority task, the deadline and execution time are considered. The comparison of simulation experiments shows that: the sum of waiting time in the execution of IEDF with enough deadline is much less than that of ordinary queuing algorithm; the number of errors in the execution of IEDF algorithm with deadline is much less than that of ordinary queuing algorithm. These results demonstrate the feasibility of the IEDF algorithm.