摘要
本文讨论了实时环境下具有m个非搶占任务,n个可搶占任务的周期性混合任务调度问题。每个任务是周期出现的,以一定的周期提出请求;每个任务必须在各自规定的时间限制内执行完。本文证明了满足T_i=KT_(i-1)关系的混合任务可调度的充分必要条件,提出了保证每个任务都在各自的时间限制内执行完的最优调度算法,并用分割法推广到多个相同的处理器系统中。最后,本文提出了今后需要进一步研究解决的问题。
In this paper,the problem of scheduling a set of real-time, mixed tasks with m non-preemptive tasks, n preemptive tasks (m, n≥1) is discussed. Necessary and sufficient conditions together with optimal algorithms that will guarantee the existence of a feasible schedule for a set of real-time, mixed tasks related by T_1=KT_(i-1)(K≥4) are developed. Partitioning method is applied to a multiprocessor computing system (identical processor) to schedule a set of real-time, mixed tasks.
出处
《计算机工程与设计》
CSCD
北大核心
1989年第1期13-23,共11页
Computer Engineering and Design
