Years and Authors of Summarized Original Work
1973; Liu, Layland
Liu and Layland  introduced rate-monotonic scheduling in the context of the scheduling of recurrent real-time processes upon a computing platform comprising a single preemptive processor.
The Periodic Task Model
The periodic task abstraction models real-time processes that make repeated requests for computation. As defined by Liu and Layland , each periodic task τi is characterized by an ordered pair of positive real-valued parameters (Ci, Ti), where Ci is the worst-case execution requirement and Ti the period of the task. The requests for computation that are made by task τi (subsequently referred to as jobs that are generated by τi) satisfy the following assumptions:
τi’s first job arrives at system start time (assumed to equal time zero), and subsequent jobs arrive every Ti time units, i.e., one job arrives at time instant k × Ti for all integer k ≥ 0.
Each job needs to execute for...
KeywordsFixed-priority scheduling Rate-monotonic analysis Real-time systems Static-priority scheduling
- 5.Eisenbrand F, Rothvoß T (2008) Static-priority real-time scheduling: response time computation is NP-hard. In: Proceedings of the IEEE real-time systems symposium, Barcelona, Nov 2008. IEEE Computer Society Press, pp 397–406Google Scholar
- 6.Gustafsson J, Betts A, Ermedahl A, Lisper B (2010) The Mälardalen WCET benchmarks – past, present and future. In: Proceedings of 10th international workshop on worst-case execution time analysis (WCET’2010), Brussels, July 2010, pp 137–147Google Scholar
- 8.Kuo T-W, Mok AK (1991) Load adjustment in adaptive real-time systems. In: Proceedings of the IEEE real-time systems symposium, San Antonio, Dec 1991. IEEE Computer Society Press, pp 160–171Google Scholar
- 9.Lehoczky J, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proceedings of the real-time systems symposium, Santa Monica, Dec 1989. IEEE Computer Society Press, pp 166–171Google Scholar