Scheduling

From Suhrid.net Wiki
Revision as of 09:10, 31 December 2011 by Suhridk (talk | contribs) (→‎Intro)
Jump to navigationJump to search

Intro

  • RT Systems must be able to interact with their environment in a timely and predictable manner.
  • Therefore an RT system must be analyzable whose timing properties can be proven and mathematically correct.
  • Scheduling is the ordering of threads/processes so that the underlying hardware and software resources can be predictably and efficiently used.
  • Scheduling consists of three components:
    • Scheduling policy: An algorithm for ordering access to resources.
    • Scheduling mechanism: An algorithm for allocation resources.
    • Schedulability/Feasibility analysis: A means of predicting the worst case behavior of the system when the policy and mechanism are applied.