首页>
外国专利>
Uniprocessor schedulability testing for non-preemptive task sets
Uniprocessor schedulability testing for non-preemptive task sets
展开▼
机译:非抢占式任务集的单处理器可调度性测试
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method of determining schedulability of tasks for uniprocessor execution includes defining a well-formed, non-preemptive task set having a plurality of tasks, each task having at least one subtask. A determination of whether the task set is schedulable is made, such that a near-optimal amount of temporal resources required to execute the task set is estimated. Further, a method of determining schedulability of a subtask for uniprocessor execution includes defining a well-formed, non-preemptive task set having a plurality of tasks, each task having at least one subtask. A determination of whether a subtask in the task set is schedulable at a specific time is made in polynomial time. Systems for implementing such methods are also provided.
展开▼