AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS
AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS
复制标题
一种分析固定优先级硬实时任务的可扩展方法
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
W. Tindell
中科院分区：
文献类型：
--
作者：
W. Tindell
随着实时计算行业从基于静态的循环高管计划转向更灵活的基于过程的调度，因此对于当前的调度分析技术非常重要，以推进并解决更现实的应用程序领域。本文扩展了当前的分析，该分析具有基于静态优先级优先级的计划；特别是，它得出了针对任意截止日期的任务的分析，这些任务可能会因tick驱动的调度程序派遣而遭受释放抖动。我们还考虑散发零星的活动，该活动偶尔到达，但随后定期执行一些有限的时间。该论文说明了如何使用基于窗口的分析技术来找到任务集的最差响应时间，并表明该技术可以依次扩展到应对现实且复杂的任务特征。
As the real-time computing industry moves away from static cyclic executive-based scheduling towards more flexible process-based scheduling, so it is important for current scheduling analysis techniques to advance and to address more realistic application areas. This paper extends the current analysis a sociated with static priority pre-emptive based scheduling; in particular it derives analysis for tasks with arbitrary deadlines that may suffer release jitter due to being dispatched by a tick driven scheduler. We also consider bursty sporadic activities, where tasks arrive sporadically but then execute periodically for some bounded time. The paper illustrates how a window-based analysis technique can be used to find the worst-case response time of a task set, and shows that the technique can be asily extended to cope with realistic and complex task characteristics.