Presentation is loading. Please wait.

Presentation is loading. Please wait.

Time Demand Analysis. Real Time System Schedulability of Fixed-Priority Tasks We have identified several simple schedulability tests for fixed priority.

Similar presentations


Presentation on theme: "Time Demand Analysis. Real Time System Schedulability of Fixed-Priority Tasks We have identified several simple schedulability tests for fixed priority."— Presentation transcript:

1 Time Demand Analysis

2 Real Time System Schedulability of Fixed-Priority Tasks We have identified several simple schedulability tests for fixed priority scheduling: – A system of n independent preemptable periodic tasks with Di = pi can be feasibly scheduled on one processor using RM if and only if U n (21/n – 1) – A system of simply periodic independent preemptable tasks with Di pi is schedulable on one processor using the RM algorithm if and only if U 1 – [similar results for DM] But: there are algorithms and regions of operation where we dont have a schedulability test and must resort to exhaustive simulation – Is there a more general schedulability test? Yes, but not as simple as those weve seen so far…

3 Real Time System Schedulability Test for Fixed- Priority Tasks Fixed priority algorithms are predictable and do not suffer from scheduling anomalies – The worst case execution time of the system occurs with the worst case execution time of the jobs – Unlike dynamic priority algorithms, which can exhibit anomalous behaviour Use this as the basis for a general schedulability test: 1.Find the critical instant when the system is most loaded, and has its worst response time 2.Use time demand analysis to determine if the system is schedulable at that instant 3.Prove that, if a fixed-priority system is schedulable at the critical instant, it is always schedulable

4 Real Time System 1.Finding the Critical Instant

5 Finding the Critical Instant

6 Real Time System Using the Critical Instant Having determined the critical instants, show that for each job Ji,c released at a critical instant, that job and all higher priority tasks complete executing before their relative deadlines If so, the entire system be schedulable… That is: dont simulate the entire system, simply show that it has correct characteristics following a critical instant – This process is called time demand analysis

7 Real Time System Time-Demand Analysis

8 Real Time System Time Demand Analysis

9 Real Time System Time Demand Analysis

10 Real-Time Systems Time Demand Analysis…calculate Example: Test if is satisfied for Time-Demand Function Ok! Not satisfied!

11 Real-Time Systems Time Demand Analysis 1.For each, determine the time-demand function according to 2.Check whether the inequality is satisfied for values of that are equal to 3. The time complexity of the time-demand analysis for each task is

12 Another example

13 Real-Time Systems Another Example: Step 1

14 Real-Time Systems Example: Step 2

15 Real-Time Systems Example: Step 3

16 Real-Time Systems Example: Step 4

17 Real Time System Time demand Analysis: Summary


Download ppt "Time Demand Analysis. Real Time System Schedulability of Fixed-Priority Tasks We have identified several simple schedulability tests for fixed priority."

Similar presentations


Ads by Google