Schedulability analysis of the rate-monotonic (RM) scheduling algorithm is an important research field in real-time systems. New dimensions in RM have been explored, ranging from faster schedulability tests to the optimal design of real-time systems. Recently, researchers have extended the schedulability problem to a more generalized case: the rate-monotonic optimal-design problem (RM-ODP), wherein the execution time is limited to an interval rather than a sole point. The RM-ODP processes task-execution-time adjustment such that (i) the system is RM schedulable and (ii) certain system performances (e.g., processor utilization) are optimized. In this paper, we review RM scheduling and summarize three aspects of the related research: (1) evaluate existing relevant feasibility tests by categorizing them based on inexact or exact conditions; (2) comprehensively review RM-ODP, summarize associated advantages and disadvantages, and provide some recommendations on schedulability tests to achieve the optimal system design under RM-scheduling policies; and (3) propose a hybrid search method based on linear programming with respect to both depth-first search and breadth-first search using the dynamic pruning strategy.

速率单调（RM）调度算法的可调度性分析是实时系统中的重要研究领域。探索了RM中的新维度，包括更快的可调度性测试到实时系统的最佳设计。最近，研究人员将可调度性问题扩展到了更普遍的情况：比率单调最优设计问题（RM-ODP），其中执行时间被限制为一个间隔而不是一个唯一的点。RM-ODP处理任务执行时间调整，以便（i）系统是RM可调度的，并且（ii）优化了某些系统性能（例如，处理器利用率）。在本文中，我们回顾了RM调度，并总结了相关研究的三个方面：（1）通过根据不精确或精确条件对现有的相关可行性测试进行分类来评估现有的相关可行性测试；（2）全面回顾RM-ODP，总结相关优点和缺点，并就可调度性测试提供一些建议，以实现RM调度策略下的最佳系统设计；（3）针对使用动态修剪策略的深度优先搜索和宽度优先搜索两者，提出了一种基于线性规划的混合搜索方法。