{"title":"A binary-tree architecture for scheduling real-time systems with hard and soft tasks","authors":"S. Sáez, Joan Vila","doi":"10.1109/SBCCI.1999.802972","DOIUrl":null,"url":null,"abstract":"Complex real-time systems are required to jointly schedule both periodic and aperiodic tasks. To do this, optimal schedulers are dynamic slack stealing algorithms (DSS). However, these software schedulers are impractical due to their large overheads that always result in delays and reduced CPU utilization. One of the proposed solutions to this problem is doing scheduling in hardware. This paper analyzes in depth a hardware design based on binary trees.","PeriodicalId":342390,"journal":{"name":"Proceedings. XII Symposium on Integrated Circuits and Systems Design (Cat. No.PR00387)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. XII Symposium on Integrated Circuits and Systems Design (Cat. No.PR00387)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBCCI.1999.802972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Complex real-time systems are required to jointly schedule both periodic and aperiodic tasks. To do this, optimal schedulers are dynamic slack stealing algorithms (DSS). However, these software schedulers are impractical due to their large overheads that always result in delays and reduced CPU utilization. One of the proposed solutions to this problem is doing scheduling in hardware. This paper analyzes in depth a hardware design based on binary trees.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
