1. Real Time Operating Systems Scheduling & Schedulers Course originally developed by Maj Ron Smith 8-Oct-15 Dr. Alain Beaulieu Scheduling & Schedulers- 7

2. Real Time Operating Systems Subtitled …Specifying Timing Constraints Modeling Timing Constraints and Resources 8-Oct-15 Dr. Alain Beaulieu Scheduling & Schedulers- 7

3. 8-Oct-15 Outline  Scheduling & Resource Management  Approaches to Scheduling (RTS)  Clock-Driven Scheduling  Round-Robin Scheduling  Priority Scheduling  Static versus Dynamic Systems & Scheduling  Periodic task Model  RTOS Schedulers Dr. Alain Beaulieu Scheduling & Schedulers- 7

4. 8-Oct-15 Scheduling and Resource Management  Scheduling algorithms - Policy  the rules under which jobs are assigned to processors are defined by the system scheduling algorithm  Resource management (access-control)  the allocation and coordination of the system (passive) resources to jobs is defined by the resource access-control protocols  The scheduler - Mechanism  the module which implements these algorithms and protocols Dr. Alain Beaulieu Scheduling & Schedulers- 7

5. 8-Oct-15 Scheduling and Resource Management  Schedules  a schedule is the assignment by the scheduler of all jobs in the system to the available processors  we assume that the scheduler is correct in that ->  It only produces valid schedules 1.at any time one processor is assigned at most one job 2. at any time each job is assigned at most one processor* 3.no job is scheduled before its release time 4.the total amount of processor time allocated is equal to each job’s maximum execution time (or actual)** 5.all precedence and resource constraints are met * implies no parallel processing at job level ** depends on algorithm Dr. Alain Beaulieu Scheduling & Schedulers- 7

6. 8-Oct-15 Scheduling and Resource Management  Feasible schedules  a feasible schedule is one in which all jobs meet their timing constraints (usually deadlines)  to say that a set of jobs is schedulable by an algorithm implies that scheduling under this algorithm always produces a feasible schedule  Optimal algorithms  finding feasible schedules is not always easy  an algorithm which always produces a feasible schedule, if one exists, is said to be optimal What does this say about a set of jobs which cannot be scheduled by an optimal algorithm? Dr. Alain Beaulieu Scheduling & Schedulers- 7

7. 8-Oct-15 Scheduling and Resource Management  Hierarchical scheduling  rarely is there ever just one scheduler in a RTS, and frequently these multiple schedulers exist within some type of hierarchical structure  may have schedulers of logical / physical devices which exist separate from the application scheduler  monitors, database servers, disk drives...  may have jobs scheduled by the application scheduler which are themselves schedulers  message handlers  Example - a queued aperiodic poller Dr. Alain Beaulieu Scheduling & Schedulers- 7

8. 8-Oct-15 Approaches to Scheduling  There are generally three broad classes, or approaches to processor scheduling:  Clock-driven scheduling  Round-robin scheduling  Priority scheduling  One can also classify scheduling schemes according to:  Off-line versus On-line scheduling  Static versus Dynamic scheduling Dr. Alain Beaulieu Scheduling & Schedulers- 7

9. 8-Oct-15 Clock-Driven Scheduling  At pre-specified time instants, a job or sequence of jobs are scheduled onto the processor(s)  job/task scheduling is designed off-line  all system job parameters are known a priori and are fixed  scheduling overhead is minimal  may be implemented using a hardware timer mechanism  illustrate by way of example on the board Dr. Alain Beaulieu Scheduling & Schedulers- 7

10. 8-Oct-15 Timer-Driven Scheduling  Observe the schedule below for this system: {T 1 = (4,1), T 2 = (5,1.5), T 3 = (20,1), T 4 = (20,2)} 046810122141618202224... hyperperiod, H = 20 slack time (space for asynchronous jobs) T1T1 T1T1 T1T1 T1T1 T1T1 T2T2 T2T2 T2T2 T2T2 T3T3 T4T4 How do we choose this design? How do we implement this design? T1T1 Dr. Alain Beaulieu Scheduling & Schedulers- 7

11. 8-Oct-15 Timer-Driven Scheduling  Rather than making scheduling decisions at arbitrary times, limit decision making to specific points in the hyperperiod, at frame boundaries 046810122141618202224... hyperperiod, H = 20 frame size, f = 4 T1T1 T1T1 T1T1 T1T1 T1T1 T2T2 T2T2 T2T2 T2T2 T3T3 T4T4 scheduling decision points major cycle No preemption within frames minor cycle on T 1 Dr. Alain Beaulieu Scheduling & Schedulers- 7

12. 8-Oct-15 Round-Robin Scheduling  In straight round robin scheduling,  ready jobs are inserted in a FIFO queue and when they reach the front of the queue they are given an equal slice of processor time  jobs are preempted at the end of their slice regardless of completion status  therefore in an n job system, each job gets 1/n th of the processor  typically processor time slices are quite short with respect to execution times Dr. Alain Beaulieu Scheduling & Schedulers- 7

13. 8-Oct-15 Weighted Round-Robin Scheduling  In weighted round robin scheduling,  each job gets wt slices of the processor time depending upon the weight of the job  therefore in an n job system, job J i gets wt i /(  wt) of the processing time  Example: JobWte% CPU J 1 23___ J 2 57___ J 3 24___ J 4 13___ What would 1 round of time slice scheduling look like? Dr. Alain Beaulieu Scheduling & Schedulers- 7

14. 8-Oct-15 Priority-Driven Scheduling  In a priority-driven system, ready jobs are assigned to processors according to their relative priorities  also called greedy scheduling or list scheduling  priorities may be static or dynamic  jobs may be preemptable or nonpreemptable  in general preemptive scheduling feels intuitively better than nonpreemptive  but there are exceptions  Most commonly supported approach in RTOS Dr. Alain Beaulieu Scheduling & Schedulers- 7

15. 8-Oct-15 Dynamic versus Static Systems  A dynamic system has a common job priority queue such that when a processor becomes available the next ready job is executed; a static system configures jobs statically on a predefined processor  Intuition says that a dynamic system will have better performance than a static one  again there are exceptions  Within a dynamic system jobs may be able to migrate or not  jobs which can not migrate start on the first available processor, and must finish there Dr. Alain Beaulieu Scheduling & Schedulers- 7

16. 8-Oct-15 Dynamic versus Static Priority Scheduling  A dynamic priority scheduling algorithm allows for task / job priorities to change at run-time  With static priority scheduling the tasks / jobs have a fixed (generally) a priori priority assignment  do not confuse this with dynamic & static systems  We will only study fixed (static) priority scheduling algorithms Dr. Alain Beaulieu Scheduling & Schedulers- 7

17. 8-Oct-15 Validating the Timing Constraints of a System  Step 1 – specification correctness  Check for consistency/correctness of constraints  Step 2 – task feasibility  Validate that each task can meet its constraints if it were to execute standalone on the processor  Step 3 – system validation*  Validate that all tasks together under the given scheduling & resource management strategy meet their respective constraints * The difficult part! Dr. Alain Beaulieu Scheduling & Schedulers- 7

18. 8-Oct-15 The Periodic Task Model  The periodic task model is a classical workload model of real-time systems; one which we will study further in this course  the underlying assumption is that each regular or semi-regular function of the system be modeled as a periodic task  each periodic task (T i ) is defined by its period (p i ) and its worst-case execution time (e i )  a task’s period is defined as the minimum length of all time intervals between release times of consecutive jobs Dr. Alain Beaulieu Scheduling & Schedulers- 7

19. 8-Oct-15 The Periodic Task Model  The accuracy of the model is dictated by how closely it resembles the system under study  it is quite accurate when the release time jitter is small (best when all tasks are truly periodic) and when the execution times of tasks are well known and have small deviations  conversely the accuracy of the model degrades if the release time jitters are high and/or the execution times have high variance Dr. Alain Beaulieu Scheduling & Schedulers- 7

20. 8-Oct-15 The Periodic Task Model  k jobs in a task T i -> J i,1, J i,2, … J i,k (k is usually infinite)  release time r i,1 of J i,1 defines the phase  of T i  given J 1,1 of (2,7]; {read this as r 1,1 =2, d 1,1 =7}  the phase of T 1,  1 = 2  the hyperperiod (H) of a set of periodic tasks is defined by their least common multiple  given tasks with periods of 3, 8 & 12  H = 24 and the maximum # of jobs N = 8 +3 +2 = 13  the amount of time a task keeps the processor busy is known as utilization  u i = e i / p i Dr. Alain Beaulieu Scheduling & Schedulers- 7

21. 8-Oct-15 The Periodic Task Model  Often we assume that within each task a job releases at the beginning of the period and that it need only complete by the end of the period  -> default deadline is equal to the period (D i = p i )  More generally, D i can be any value  we can model job precedence in terms of release times and deadlines  example: r 1,1 = 0, d 1,1 = 3, r 1,2 = 3, d 1,2 = 7 -> J 1,1 < J 1,2 How can we use deadline to minimize response jitter? Dr. Alain Beaulieu Scheduling & Schedulers- 7

22. 8-Oct-15 Release vs Response Time Jitter  Let’s examine the difference between release time jitter and response time jitter of a real- time system modeled under the periodic task model. See Labrosse handout Dr. Alain Beaulieu Scheduling & Schedulers- 7

23. 8-Oct-15 Execution Jitter – case 1 Dr. Alain Beaulieu Scheduling & Schedulers- 7

24. 8-Oct-15 Execution Jitter - case 2 Dr. Alain Beaulieu Scheduling & Schedulers- 7

25. 8-Oct-15 Execution Jitter - case 3 Dr. Alain Beaulieu Scheduling & Schedulers- 7

26. 8-Oct-15 The Periodic Task Model  Aperiodic and sporadic tasks model events which arrive (release) unpredictably  the inter-arrival times of these tasks are identically distributed random variables  the execution times of these tasks are also i.d. random variables  Aperiodic tasks have jobs with soft or no deadlines  example: Automobile Collision Avoidance System – update situational awareness display  Sporadic tasks have jobs with hard deadlines  example: ACAS – disengage auto-steering Dr. Alain Beaulieu Scheduling & Schedulers- 7

27. 8-Oct-15 Question  What about system overhead times such as context switching? Dr. Alain Beaulieu Scheduling & Schedulers- 7

28. 8-Oct-15 References [1] Liu, J.W.S., “Real-Time Systems”, Prentice- Hall, 2000. [2] Labrosse, J.J., “MicroC/OS-II” 1 st and 2 nd Editions (1999, 2002) Dr. Alain Beaulieu Scheduling & Schedulers- 7