RM及其扩展可调度性判定算法性能分析

可调度性判定是实时调度算法的关键问题.单调速率算法RM(rate monotonic)及其扩展是应用广泛的实时调度算法，大量文献讨论了实时任务在这些算法下的可调度性判定，给出了相应的判定算法.但迄今为止，对这些判定算法的性能分析都是理论上的定性分析或者只是少数几种判定算法之间的简单比较，这不利于实时系统的开发.归纳了RM及其扩展的可调度性判定算法，通过测试平台，系统地测试和分析了各算法的性能和适用场合，讨论了各种条件和实现方式对算法性能和可调度性的影响.

Schedulability Test Performance Analysis of Rate Monotonic Algorithm and Its Extended Ones

Schedulability test is a key problem for real-time scheduling algorithms. Since first introduced by Liu and Layland in 1973, the RM (rate monotonic) algorithm and its extended ones have been widely used in many fields such as digital control, command and control, signal processing, and communication systems. A lot of work has been done to investigate their schedulability, and present their corresponding schedulability tests. As the implementation of real-time systems requires the consideration of the practical issues such as the number of tasks, the period of each task, and scheduling costs, a systematic performance analysis platform is required to give them a thorough evaluation. In this paper, all schedulability tests of RM and its extended ones are summarized, a platform is developed to test and compare their performance, and a thorough evaluation and comparison is made of the schedulability tests through testing. These results and analysis are very beneficial for selecting appropriate algorithms in real-time system design and implementation.