Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing

1994 Proceedings Real-Time Systems Symposium Pub Date : 1994-12-07 DOI:10.1109/REAL.1994.342733

S. R. Thuel, J. Lehoczky

引用次数: 146

Abstract

This paper discusses the problem of jointly scheduling hard deadline periodic tasks and hard deadline aperiodic tasks using fixed priority methods. The approach is based on the slack stealing algorithm developed by the authors, and it assumes that the periodic deadlines must all be met. The paper develops a hard aperiodic acceptance test algorithm for guaranteeing tasks at any priority level, and it corrects an error in the original guarantee algorithm presented in Ramos-Thuel and Lehoczky (1993). It is shown that there is no optimal priority assignment for hard aperiodic task, but guidelines are given for choosing a good priority assignment.<>

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

固定优先级系统中基于松弛窃取的硬非周期任务调度算法

本文讨论了采用固定优先级方法联合调度硬期限周期任务和硬期限非周期任务的问题。该方法基于作者提出的松弛窃取算法，并假设周期期限必须全部满足。本文提出了一种保证任意优先级任务的硬非周期验收测试算法，并修正了Ramos-Thuel和Lehoczky(1993)原始保证算法中的一个错误。结果表明，硬非周期任务不存在最优优先级分配，但给出了选择最佳优先级分配的准则。

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

求助全文

约1分钟内获得全文去求助

来源期刊

1994 Proceedings Real-Time Systems Symposium

自引率

0.00%

发文量

期刊最新文献

Dynamic end-to-end guarantees in distributed real time systems Scaling and performance of a priority packet queue for real-time applications A solution to an automotive control system benchmark Modeling DSP operating systems for multimedia applications An accurate worst case timing analysis technique for RISC processors