Memory and time-efficient schedulability analysis of task sets with stochastic execution time
Memory and time-efficient schedulability analysis of task sets with stochastic execution time
复制标题
具有随机执行时间的任务集的内存和时间高效可调度性分析
DOI：
10.1109/emrts.2001.933991
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Zebo Peng
中科院分区：
文献类型：
--
作者：
Sorin Manolache;P. Eles;Zebo Peng
本文提出了一种分析任务集性能的有效方法，其中任务执行时间被指定为一种广义连续概率分布。我们考虑具有截止期限小于或等于周期的周期性（可能相关且不可抢占）的固定任务集。我们的方法不限于任何特定的调度策略，并支持具有动态和静态优先级的策略。提出了一种以节省内存和时间的方式构建基础随机过程的算法。我们从分析时间和所需内存的角度讨论了各种参数对复杂性的影响。实验结果表明了所提方法的有效性。
This paper presents an efficient way to analyse the performance of task sets, where the task execution time is specified as a generalized continuous probability distribution. We consider fixed task sets of periodic, possibly dependent, non-pre-emptable tasks with deadlines less than or equal to the period. Our method is not restricted to any specific scheduling policy and supports policies with both dynamic and static priorities. An algorithm to construct the underlying stochastic process in a memory and time efficient way is presented. We discuss the impact of various parameters on complexity, in terms of analysis time and required memory. Experimental results show the efficiency of the proposed approach.