一种基于鲁棒最早截止日期算法的硬件加速实时任务调度程序

L. Kohútka, V. Stopjaková
{"title":"一种基于鲁棒最早截止日期算法的硬件加速实时任务调度程序","authors":"L. Kohútka, V. Stopjaková","doi":"10.1109/DTIS.2018.8368551","DOIUrl":null,"url":null,"abstract":"This paper presents novel design of a coprocessor that implements the existing task scheduling algorithm called Robust Earliest Deadline (RED). Thanks to the HW implementation, the scheduler operations are always completed in two clock cycles regardless of the number of tasks to be scheduled. Resource costs are evaluated by synthesis for Intel FPGA Cyclone V. Three different real-time task schedulers are compared: EDF-based scheduler suitable for hard real-time tasks only, GED-based scheduler suitable for soft real-time tasks only, and the proposed RED-based scheduler. The proposed scheduler handles deviations of task execution times better, achieves higher CPU utilization and can be used for scheduling of hard real-time, soft real-time and non-real-time tasks within one system, which was not possible with the former existing solutions.","PeriodicalId":328650,"journal":{"name":"2018 13th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A novel hardware-accelerated real-time task scheduler based on robust earliest deadline algorithm\",\"authors\":\"L. Kohútka, V. Stopjaková\",\"doi\":\"10.1109/DTIS.2018.8368551\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents novel design of a coprocessor that implements the existing task scheduling algorithm called Robust Earliest Deadline (RED). Thanks to the HW implementation, the scheduler operations are always completed in two clock cycles regardless of the number of tasks to be scheduled. Resource costs are evaluated by synthesis for Intel FPGA Cyclone V. Three different real-time task schedulers are compared: EDF-based scheduler suitable for hard real-time tasks only, GED-based scheduler suitable for soft real-time tasks only, and the proposed RED-based scheduler. The proposed scheduler handles deviations of task execution times better, achieves higher CPU utilization and can be used for scheduling of hard real-time, soft real-time and non-real-time tasks within one system, which was not possible with the former existing solutions.\",\"PeriodicalId\":328650,\"journal\":{\"name\":\"2018 13th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS)\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 13th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DTIS.2018.8368551\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 13th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DTIS.2018.8368551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文提出了一种新的协处理器设计,实现了现有的任务调度算法鲁棒最早截止时间(RED)。由于采用了HW实现,调度程序操作总是在两个时钟周期内完成,而不管要调度的任务有多少。对三种不同的实时任务调度器进行了比较:仅适用于硬实时任务的基于edf的调度器,仅适用于软实时任务的基于ged的调度器,以及提出的基于red的调度器。该调度器能更好地处理任务执行时间的偏差,实现更高的CPU利用率,并可用于一个系统内的硬实时、软实时和非实时任务的调度,这是现有方案无法实现的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel hardware-accelerated real-time task scheduler based on robust earliest deadline algorithm
This paper presents novel design of a coprocessor that implements the existing task scheduling algorithm called Robust Earliest Deadline (RED). Thanks to the HW implementation, the scheduler operations are always completed in two clock cycles regardless of the number of tasks to be scheduled. Resource costs are evaluated by synthesis for Intel FPGA Cyclone V. Three different real-time task schedulers are compared: EDF-based scheduler suitable for hard real-time tasks only, GED-based scheduler suitable for soft real-time tasks only, and the proposed RED-based scheduler. The proposed scheduler handles deviations of task execution times better, achieves higher CPU utilization and can be used for scheduling of hard real-time, soft real-time and non-real-time tasks within one system, which was not possible with the former existing solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信