一种新的软实时任务硬件加速调度器

L. Kohútka, V. Stopjaková
{"title":"一种新的软实时任务硬件加速调度器","authors":"L. Kohútka, V. Stopjaková","doi":"10.1109/MECO.2019.8760040","DOIUrl":null,"url":null,"abstract":"This paper presents a coprocessor design that performs task scheduling for soft real-time systems. The proposed solution is based on the Guaranteed Earliest Deadline (GED) algorithm. Thanks to hardware implementation of the scheduler, the scheduler operations are always performed in two clock cycles regardless of the actual number of tasks and the maximum number of tasks in the system. Through synthesis results, two versions of the scheduler were compared: an existing EDF based scheduler and the proposed GED based scheduler. Both schedulers were verified using simplified version of Universal Verification Methodology (UVM) and applying millions of instructions with randomly generated deadline values. The FPGA resource costs have been evaluated by synthesis into Intel FPGA Cyclone V.","PeriodicalId":141324,"journal":{"name":"2019 8th Mediterranean Conference on Embedded Computing (MECO)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A New Hardware-Accelerated Scheduler for Soft Real-Time Tasks\",\"authors\":\"L. Kohútka, V. Stopjaková\",\"doi\":\"10.1109/MECO.2019.8760040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a coprocessor design that performs task scheduling for soft real-time systems. The proposed solution is based on the Guaranteed Earliest Deadline (GED) algorithm. Thanks to hardware implementation of the scheduler, the scheduler operations are always performed in two clock cycles regardless of the actual number of tasks and the maximum number of tasks in the system. Through synthesis results, two versions of the scheduler were compared: an existing EDF based scheduler and the proposed GED based scheduler. Both schedulers were verified using simplified version of Universal Verification Methodology (UVM) and applying millions of instructions with randomly generated deadline values. The FPGA resource costs have been evaluated by synthesis into Intel FPGA Cyclone V.\",\"PeriodicalId\":141324,\"journal\":{\"name\":\"2019 8th Mediterranean Conference on Embedded Computing (MECO)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 8th Mediterranean Conference on Embedded Computing (MECO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MECO.2019.8760040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 8th Mediterranean Conference on Embedded Computing (MECO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MECO.2019.8760040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本文提出了一种用于软实时系统任务调度的协处理器设计。该解决方案基于保证最早截止日期(GED)算法。由于调度器的硬件实现,无论系统中的实际任务数和最大任务数是多少,调度器操作总是在两个时钟周期内执行。通过综合结果,比较了两个版本的调度程序:现有的基于EDF的调度程序和提出的基于GED的调度程序。这两个调度器都使用简化版的通用验证方法(Universal Verification Methodology, UVM)进行了验证,并应用了数百万条具有随机生成的截止日期值的指令。通过集成到Intel FPGA Cyclone V中,对FPGA资源成本进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Hardware-Accelerated Scheduler for Soft Real-Time Tasks
This paper presents a coprocessor design that performs task scheduling for soft real-time systems. The proposed solution is based on the Guaranteed Earliest Deadline (GED) algorithm. Thanks to hardware implementation of the scheduler, the scheduler operations are always performed in two clock cycles regardless of the actual number of tasks and the maximum number of tasks in the system. Through synthesis results, two versions of the scheduler were compared: an existing EDF based scheduler and the proposed GED based scheduler. Both schedulers were verified using simplified version of Universal Verification Methodology (UVM) and applying millions of instructions with randomly generated deadline values. The FPGA resource costs have been evaluated by synthesis into Intel FPGA Cyclone V.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信