Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 751–754Cite as

Rate-Monotonic Scheduling

1973; Liu, Layland

  • Reference work entry

  • 604 Accesses

Keywords and Synonyms

Real-time systems; Static-priority scheduling ; Fixed-priority scheduling ; Rate-monotonic analysis      

Problem Definition

Liu and Layland [9] introduced rate-monotonic scheduling in the context of the scheduling of recurrent real-time processes upon a computing platform comprised of a single preemptive processor.

The Periodic Task Model

The periodic task abstraction models real-time processes that make repeated requests for computation. As defined in [9], each periodic task \( { \tau_i } \) is characterized by an ordered pair of positive real-valued parameters \( { (C_i, T_i) } \), where C i is the worst-case execution requirement and T i the period of the task. The requests for computation that are made by task \( { \tau_i } \) (subsequently referred to as jobs that are generated by \( { \tau_i } \)) satisfy the following assumptions:

A1::

\( { \tau_i } \)'s first job arrives at system start time (assumed to equal time zero), and subsequent jobs arrive every T...

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Audsley, N., Burns, A., Wellings, A.: Deadline monotonic scheduling theory and application. Control Eng. Pract. 1, 71–78 (1993)

    Google Scholar 

  2. Baker, T.P.: Stack-based scheduling of real-time processes. Real-Time Systems: The Int. J. Time-Critical Comput. 3, 67–100 (1991)

    Google Scholar 

  3. Bini, E., Buttazzo, G., Buttazzo, G.: Rate monotonic scheduling: The hyperbolic bound. IEEE Trans. Comput. 52, 933–942 (2003)

    Article  Google Scholar 

  4. Gardener, M.K.: Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems. Ph. D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign (1999)

    Google Scholar 

  5. Klein, M., Ralya, T., Pollak, B., Obenza, R., Harbour, M.G.: A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, Boston (1993)

    Book  Google Scholar 

  6. Kuo, T.-W., Mok, A.K.: Load adjustment in adaptive real-time systems. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 160–171. San Antonio, December 1991

    Google Scholar 

  7. Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In: Proceedings of the Real-Time Systems Symposium – 1989, Santa Monica, December 1989. IEEE Computer Society Press, pp. 166–171

    Google Scholar 

  8. Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval. 2, 237–250 (1982)

    Google Scholar 

  9. Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20, 46–61 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rajkumar, R.: Synchronization In Real-Time Systems – A Priority Inheritance Approach. Kluwer Academic Publishers, Boston (1991)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of North Carolina, Chapel Hill, NC, USA

    Nathan Fisher & Sanjoy Baruah

Authors
  1. Nathan Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjoy Baruah
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Fisher, N., Baruah, S. (2008). Rate-Monotonic Scheduling. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_334

Download citation

Publish with us

Policies and ethics

Search

Navigation