Abstract
Rate monotonic and deadline monotonic scheduling are commonly used for periodic real-time task systems. This paper discusses a feasibility decision for a given real-time task system when the system is scheduled by rate monotonic and deadline monotonic scheduling. The time complexity of existing feasibility decision algorithms depends on both the number of tasks and maximum periods or deadlines when the periods and deadlines are integers. This paper presents a new necessary and sufficient condition for a given task system to be feasible and proposes a new feasibility decision algorithm based on that condition. The time complexity of this algorithm depends solely on the number of tasks. This condition can also be applied as a sufficient condition for a task system using priority inheritance protocols to be feasible with rate monotonic and deadline monotonic scheduling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Audsley, N.C., Burns, A., Davis, R.I., Tindell, K.W., and Wellings, A.J. 1995. Fixed Priority Scheduling: An Historical Perspective. Real-Time Systems 8: 173–198.
Baker, T. P. 1991. Stack-Based Scheduling of Realtime Processes. Real-Time Systems 3: 67–99.
Baruah, S. K., Rosier, L. E., and Howell, R. R. 1990. Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor. Real-Time Systems 3: 301–324.
Cheng, S.-C. 1987. Scheduling Algorithms for Hard Real-Time Systems. In Hard Real-Time Systems IEEE Computer Society Press, 150–173.
Kosugi, N., Takashio, K., and Tokoro, M. 1994. Modification and Adjustment of Real-Time Tasks with Rate Monotonic Scheduling Algorithm. Proc. 2nd Workshop on Parallel and Distributed Real-Time Systems pp. 98–103.
Kuo, T.-W. and Mok, A. K. 1991. Load Adjustment in Adaptive Real-Time Systems. Proc. Real-Time Systems Symp. pp. 160–170.
Lehoczky, J.P., Sha, L., and Ding, Y. 1989. The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior. Proc. Real-Time Systems Symp. pp. 166–171.
Lehoczky, J.P., Sha, L., Strosnider, J.K., and Tokuda, H. 1991. Fixed Priority Scheduling Theory for Hard Real-Time Systems. In Foundations of Real-Time Computing: Scheduling and Resource Management. Kluwer Academic Publishers, 1–30.
Leung, J. Y.-T. and Merrill, M. L. 1980. A Note on Preemptive Scheduling of Periodic, Real-Time Tasks. Information Processing Letters 11:115–118
Leung, J. Y.-T. and Whitehead, J. 1982. On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks. Performance Evaluation 2: 237–250.
Liu, C. L. and Layland, J. W. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. J. of the ACM 20:46–61.
Ramos-Thuel, S. and Lehoczky, J. P. 1993. On-Line Scheduling of Hard Deadline Aperiodic Tasks in Fixed-Priority Systems. Proc. Real-Time Systems Symp. pp. 160–171.
Sha, L., Rajkumar, R., Lehoczky, J., and Ramamritham, K. 1989. Mode Change Protocols for Priority-Driven Preemptive Scheduling. Real-Time Systems 1:243–264.
Sha, L., Rajkumar, R., and Lehoczky, J. P. 1990. Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Trans. Comput. 39:175–185.
Sha, L. and Sathaye, S. S. 1993. A Systematic Approach to Designing Distributed Real-Time Systems. IEEE Computer 26:68–78.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Manabe, Y., Aoyagi, S. A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling. Real-Time Systems 14, 171–181 (1998). https://doi.org/10.1023/A:1007964900035
Issue Date:
DOI: https://doi.org/10.1023/A:1007964900035