一种用于调度具有硬任务和软任务的实时系统的二叉树结构

Proceedings. XII Symposium on Integrated Circuits and Systems Design (Cat. No.PR00387) Pub Date : 1999-09-29 DOI:10.1109/SBCCI.1999.802972

S. Sáez, Joan Vila

{"title":"一种用于调度具有硬任务和软任务的实时系统的二叉树结构","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":"{\"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}","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

摘要

复杂的实时系统需要联合调度周期性和非周期性任务。为此，最优调度程序是动态空闲窃取算法(DSS)。然而，这些软件调度器不切实际，因为它们的开销很大，总是导致延迟和降低CPU利用率。针对这个问题提出的解决方案之一是在硬件中进行调度。本文深入分析了一种基于二叉树的硬件设计。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A binary-tree architecture for scheduling real-time systems with hard and soft tasks

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. XII Symposium on Integrated Circuits and Systems Design (Cat. No.PR00387)

自引率

0.00%

发文量