【摘要】 固定优先级任务的可调度性判定是实时系统调度理论研究的核心问题之一。提出了一种可行的DMS(Deadline Monotonic Scheduling,简称DMS)可调度性判定方法—确切性判定方法(precised schedulability test algorithm简称PSTA),利用DMS调度的充要条件,保证任何任务集均可被判定,并且判定结果是确切的。首先给出了DMS调度模型,介绍了可调度性判定的基本思想,然后通过实验提出并验证了PSTA相关的结论。更多还原

【Abstract】 Schedulability test of fixed priority tasks is one of the core issues of the study on real -time system scheduling theory. A feasible DMS schedulability testalgorithm--precise schedulability test algorithm(PSTA) was proposed therefore,which ensured that all tasks could be tested by using the necessary and sufficient conditions ofDMS scheduling with precise tested results. This paper firstly gave the scheduling module ofDMS, introduced the basic concept of schedulability test, and then verified the resultsrelated to PSTA by taking experiments.更多还原