Real-Time Workload Models with Efficient Analysis
|
|
- Alexander Benson
- 5 years ago
- Views:
Transcription
1 Real-Time Workload Models with Efficient Analysis Advanced Course, 3 Lectures, September 2014 Martin Stigge Uppsala University, Sweden
2 Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic Tasks Frames and Branching The Digraph Real-Time (DRT) Task Model Adaptive Variable-Rate (AVR) Tasks 2 Feasibility Analysis of DRT Feasibility Theorem Demand Pairs Test Termination Evaluation 3 Static Priority Schedulability Analysis of DRT Response-Time Analysis Request Functions Refinement Algorithm Evaluation Martin Stigge Workload Models + Analysis 2
3 Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic Tasks Frames and Branching The Digraph Real-Time (DRT) Task Model Adaptive Variable-Rate (AVR) Tasks 2 Feasibility Analysis of DRT Feasibility Theorem Demand Pairs Test Termination Evaluation 3 Static Priority Schedulability Analysis of DRT Response-Time Analysis Request Functions Refinement Algorithm Evaluation Martin Stigge Workload Models + Analysis 2
4 Problem Overview Workload Model Scheduler Model Task A Task B EDF/Static Prio/... Task C Task A Task B t t Feasible? Schedulable? Response times? Martin Stigge Workload Models + Analysis 3
5 The Liu and Layland (L&L) Task Model (Liu and Layland, 1973) Tasks are periodic Job WCET e Period p (implicit deadline) (e, p) e p e p... t Advantages: Well-known model; efficient schedulability tests Disadvantage: Very limited expressiveness Martin Stigge Workload Models + Analysis 4
6 A Hierarchy of Models difficult high Schedulability Analysis Expressiveness efficient Liu & Layland (e, d = p) low Martin Stigge Workload Models + Analysis 5
7 The Sporadic Task Model (Mok, 1983) Deadlines periods; releases sporadic Each tasks defined by: Job WCET e Relative deadline d Minimum inter-release delay p (e, d, p) e d p e d p... t Martin Stigge Workload Models + Analysis 6
8 The General Multiframe (GMF) Task Model Behavior is not always periodic Frame 0 Frame 1 Frame 2 Frame 3 Frame 0 Task is split into frames, each with own Execution time e (j) Inter-release separation p (j) Deadline d (j) for the job t Martin Stigge Workload Models + Analysis 7
9 The General Multiframe (GMF) Task Model Behavior is not always periodic Frame 0 Frame 1 Frame 2 Frame 3 Frame 0 Task is split into frames, each with own Execution time e (j) Inter-release separation p (j) Deadline d (j) for the job t Martin Stigge Workload Models + Analysis 7
10 The General Multiframe (GMF) Task Model (cont.) (Baruah et al., 1999) Tasks cycle through job types Vector for WCET (e (1),..., e (n) ) Vector for deadlines (d (1),..., d (n) ) Vector for minimum inter-release delays (p (1),..., p (n) ) p (2) J 3 J 2 p (1) p (3) J 1 J 4 J 5 p (5) p (4) d (1) d (2) e (1) e (2)... t p (1) p (2) Martin Stigge Workload Models + Analysis 8
11 A Hierarchy of Models difficult high Schedulability Analysis generalized multiframe (GMF) (e i, d i, p i ) Expressiveness efficient multiframe (e i, d = p) Liu & Layland (e, d = p) sporadic (e, d, p) low Martin Stigge Workload Models + Analysis 9
12 The Non-Cyclic GMF Task Model (Moyo et al., 20) Frame order unknown a priori Syntax similar to GMF: Vector for WCET (e (1),..., e (n) ) Vector for deadlines (d (1),..., d (n) ) Vector for minimum inter-release delays (p (1),..., p (n) ) J 2 J 3 J 1 J 4 J 5 d (1) d (2) e (1) e (2)... t p (1) p (2) Martin Stigge Workload Models + Analysis
13 The Recurring Branching (RB) Task Model (Baruah, 1998) Introduces branching structures Tree for tasks Vertices J: jobs to be released (with WCET and deadline) Edges (J i, J j ): minimum inter-release delays p(j i, J j ) General period parameter P J 3 J 5 J 1 J 6 Period P = 57 J 2 J 4 Martin Stigge Workload Models + Analysis 11
14 The Recurring Branching (RB) Task Model (Baruah, 1998) Introduces branching structures Tree for tasks Vertices J: jobs to be released (with WCET and deadline) Edges (J i, J j ): minimum inter-release delays p(j i, J j ) General period parameter P J 3 J 5 J 1 J 6 Period P = 57 J 2 J 4 Martin Stigge Workload Models + Analysis 11
15 The Recurring Real-Time (RRT) Task Model (Baruah, 1998) Compact Branching representation Directed acyclic graph (DAG) for tasks Vertices J: jobs to be released (with WCET and deadline) Edges (J i, J j ): minimum inter-release delays p(j i, J j ) General period parameter P J 3 J 5 J 1 Period P = 57 J 2 J 4 Martin Stigge Workload Models + Analysis 12
16 A Hierarchy of Models difficult high Schedulability Analysis efficient recurring RT (RRT) (DAG, p) recurring branching (RB) (tree, p) generalized multiframe (GMF) (e i, d i, p i ) multiframe (e i, d = p) Liu & Layland (e, d = p) non-cyclic RRT (DAG, p i ) non-cyclic GMF (order arbitrary) sporadic (e, d, p) Expressiveness low Martin Stigge Workload Models + Analysis 13
17 Restrictions of RRT Tasks are still recurrent J 3 J 5 Always revisit source J 1 No cycles allowed! J 1 J 2 J 6 J 4 Consequences: No local loops Not compositional (for modes etc.) Martin Stigge Workload Models + Analysis 14
18 Restrictions of RRT Tasks are still recurrent J 3 J 5 Always revisit source J 1 No cycles allowed! J 1 J 2 J 6 J 4 Consequences: No local loops Not compositional (for modes etc.) Martin Stigge Workload Models + Analysis 14
19 Restrictions of RRT Tasks are still recurrent J 3 J 5 Always revisit source J 1 No cycles allowed! J 1 J 2 J 6 J 4 Consequences: No local loops Not compositional (for modes etc.) Martin Stigge Workload Models + Analysis 14
20 The Digraph Real-Time (DRT) Task Model (S. et al., 2011) Generalizes periodic, sporadic, GMF, RRT,... Directed graph for each task Vertices v: jobs to be released (with WCET and deadline) Edges (u, v): minimum inter-release delays p(u, v) 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 Martin Stigge Workload Models + Analysis 15
21 DRT: Semantics 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 Martin Stigge Workload Models + Analysis 16
22 DRT: Semantics 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 Path π = (v 4 ) 1, t Martin Stigge Workload Models + Analysis 16
23 DRT: Semantics 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 Path π = (v 4, v 2 ) 1, t 20 Martin Stigge Workload Models + Analysis 16
24 DRT: Semantics 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 Path π = (v 4, v 2, v 3 ) 1, t Martin Stigge Workload Models + Analysis 16
25 A Hierarchy of Models difficult high Schedulability Analysis efficient recurring RT (RRT) (DAG, p) recurring branching (RB) (tree, p) generalized multiframe (GMF) (e i, d i, p i ) multiframe (e i, d = p) Liu & Layland (e, d = p) Digraph (DRT) (arbitrary graph) non-cyclic RRT (DAG, p i ) non-cyclic GMF (order arbitrary) sporadic (e, d, p) Expressiveness low Martin Stigge Workload Models + Analysis 17
26 A Hierarchy of Models difficult Schedulability Analysis efficient Strongly (co)np-hard Pseudo-Polynomial recurring RT (RRT) (DAG, p) recurring branching (RB) (tree, p) generalized multiframe (GMF) (e i, d i, p i ) multiframe (e i, d = p) Liu & Layland (e, d = p) Digraph (DRT) (arbitrary graph) non-cyclic RRT (DAG, p i ) non-cyclic GMF (order arbitrary) sporadic (e, d, p) high Expressiveness low Martin Stigge Workload Models + Analysis 17
27 Extended DRT (EDRT) Extends DRT with global delay constraints Directed graph for each task Vertices v: jobs to be released (with WCET and deadline) Edges (u, v): minimum inter-release delays p(u, v) k global constraints (u, v, γ) 2 v 3 5 v 2 v v 5 7 v Theorem (S. et al., 2011) For k-edrt task systems with bounded utilization, feasibility is 1 decidable in pseudo-polynomial time if k is constant, and 2 strongly conp-hard in general. Martin Stigge Workload Models + Analysis 18
28 Extended DRT (EDRT) Extends DRT with global delay constraints Directed graph for each task Vertices v: jobs to be released (with WCET and deadline) Edges (u, v): minimum inter-release delays p(u, v) k global constraints (u, v, γ) 2 v 3 5 v 2 v v 5 7 v Theorem (S. et al., 2011) For k-edrt task systems with bounded utilization, feasibility is 1 decidable in pseudo-polynomial time if k is constant, and 2 strongly conp-hard in general. Martin Stigge Workload Models + Analysis 18
29 A Hierarchy of Models difficult Schedulability Analysis efficient Strongly (co)np-hard Pseudo-Polynomial recurring RT (RRT) (DAG, p) recurring branching (RB) (tree, p) generalized multiframe (GMF) (e i, d i, p i ) multiframe (e i, d = p) Liu & Layland (e, d = p) Extended DRT (EDRT) (constraints) k-edrt (k constraints) Digraph (DRT) (arbitrary graph) non-cyclic RRT (DAG, p i ) non-cyclic GMF (order arbitrary) sporadic (e, d, p) high Expressiveness low Martin Stigge Workload Models + Analysis 19
30 DRT Examples e, d v p Sporadic Task Martin Stigge Workload Models + Analysis 20
31 DRT Examples e, d v p Sporadic Task e, p v p Sporadic Task (implicit deadline) Martin Stigge Workload Models + Analysis 20
32 DRT Examples e, d v p Sporadic Task e, p v p Sporadic Task (implicit deadline) e 1, d 1 p 1 e 2, p 2 p 1 u v p 2 p 2 Sporadic Task with 2 modes Martin Stigge Workload Models + Analysis 20
33 v 4 v 5 DRT Examples e, d v p Sporadic Task e, p v p Sporadic Task (implicit deadline) e 1, d 1 p 1 e 2, p 2 p 1 u v p 2 p 2 Sporadic Task with 2 modes v 3 v 2 v 1 GMF Task Martin Stigge Workload Models + Analysis 20
34 DRT Examples e, d v p Sporadic Task e, p v p Sporadic Task (implicit deadline) e 1, d 1 p 1 e 2, p 2 p 1 u v p 2 p 2 Sporadic Task with 2 modes v 3 v 2 v 1 v 1 v 2 v 5 v 4 v 5 GMF Task v 3 v 4 Branching Task Martin Stigge Workload Models + Analysis 20
35 Adaptive Variable-Rate (AVR) Tasks Rate-Adaptive Tasks (Buttazzo et al., DATE 2014) Variable Rate-dependent Behaviour (VRB) (Davis et al., RTAS 2014) Adaptive Variable-Rate (AVR) Tasks (Biondi et al., ECRTS 2014)... (Biondi, ECRTS 2014) Martin Stigge Workload Models + Analysis 21
36 AVR Tasks: Execution Modes (Biondi, ECRTS 2014) Martin Stigge Workload Models + Analysis 22
37 AVR Business (This morning in Pisa) Martin Stigge Workload Models + Analysis 23
38 Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic Tasks Frames and Branching The Digraph Real-Time (DRT) Task Model Adaptive Variable-Rate (AVR) Tasks 2 Feasibility Analysis of DRT Feasibility Theorem Demand Pairs Test Termination Evaluation 3 Static Priority Schedulability Analysis of DRT Response-Time Analysis Request Functions Refinement Algorithm Evaluation Martin Stigge Workload Models + Analysis 24
39 Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic Tasks Frames and Branching The Digraph Real-Time (DRT) Task Model Adaptive Variable-Rate (AVR) Tasks 2 Feasibility Analysis of DRT Feasibility Theorem Demand Pairs Test Termination Evaluation 3 Static Priority Schedulability Analysis of DRT Response-Time Analysis Request Functions Refinement Algorithm Evaluation Martin Stigge Workload Models + Analysis 24
40 Feasibility Theorem Theorem For a task set τ, the following three properties are equivalent. 1 Task set τ is feasible. 2 Task set τ is EDF schedulable. 3 The following condition holds: t 0 : T τ dbf T (t) t Martin Stigge Workload Models + Analysis 25
41 Feasibility Theorem Theorem For a task set τ, the following three properties are equivalent. 1 Task set τ is feasible. 2 Task set τ is EDF schedulable. 3 The following condition holds: t 0 : T τ dbf T (t) t What is dbf T (t)? How to compute it? Martin Stigge Workload Models + Analysis 25
42 Demand-Bound Functions dbf T (t): Maximal demand in any window of size t t 43 Demand: = 9 Martin Stigge Workload Models + Analysis 26
43 Feasibility Test Theorem (Feasibility Theorem) For a task set τ, the following three properties are equivalent. 1 Task set τ is feasible. 2 Task set τ is EDF schedulable. 3 The following condition holds: t 0 : T τ dbf T (t) t dbft (t) t Martin Stigge Workload Models + Analysis 27
44 Feasibility Test Theorem (Feasibility Theorem) For a task set τ, the following three properties are equivalent. 1 Task set τ is feasible. 2 Task set τ is EDF schedulable. 3 The following condition holds: t 0 : T τ dbf T (t) t dbft (t) t t Martin Stigge Workload Models + Analysis 27
45 Feasibility Test Theorem (Feasibility Theorem) For a task set τ, the following three properties are equivalent. 1 Task set τ is feasible. 2 Task set τ is EDF schedulable. 3 The following condition holds: t 0 : T τ dbf T (t) t dbft (t) t t Martin Stigge Workload Models + Analysis 27
46 Feasibility Test Theorem (Feasibility Theorem) For a task set τ, the following three properties are equivalent. 1 Task set τ is feasible. 2 Task set τ is EDF schedulable. 3 The following condition holds: t 0 : T τ dbf T (t) t dbft (t) t 1 How to calculate dbf T (t)? 2 How to check existence of violating t? t Martin Stigge Workload Models + Analysis 27
47 dbf for Sporadic Tasks dbft (t) Sporadic task T = (e, d, p) e d p t Martin Stigge Workload Models + Analysis 28
48 dbf for Sporadic Tasks dbft (t) Sporadic task T = (e, d, p) e d p t { t d dbf T (t) = max 0, p } + 1 e Martin Stigge Workload Models + Analysis 28
49 dbf for DRT: From G(T ) to dbf T 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 dbf T (t) Martin Stigge Workload Models + Analysis 29 t
50 dbf for DRT: From G(T ) to dbf T 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 dbf T (t) , Martin Stigge Workload Models + Analysis 29 t
51 dbf for DRT: From G(T ) to dbf T 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 Path Abstraction: Demand Pair dbf T (t) , Martin Stigge Workload Models + Analysis 29 t
52 dbf for DRT: From G(T ) to dbf T 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 Path Abstraction: Demand Pair dbf T (t) , Martin Stigge Workload Models + Analysis 29 t
53 dbf for DRT: From G(T ) to dbf T 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 Path Abstraction: Demand Pair dbf T (t) , Martin Stigge Workload Models + Analysis 29 t
54 Demand Pairs Formally: Given path π = (π 0,..., π l ) Execution demand: e(π) := l i=0 e(π i) Deadline: d(π) := l 1 i=0 p(π i, π i+1 ) + d(π l ) e(π), d(π) is a demand pair for π dbf T (t) = max {e e, d demand pair with d t} How to compute all demand pairs? Enumerate paths: Too expensive! (Exponential..) Better: Iteration using abstraction Martin Stigge Workload Models + Analysis 30
55 Demand Pairs Formally: Given path π = (π 0,..., π l ) Execution demand: e(π) := l i=0 e(π i) Deadline: d(π) := l 1 i=0 p(π i, π i+1 ) + d(π l ) e(π), d(π) is a demand pair for π dbf T (t) = max {e e, d demand pair with d t} How to compute all demand pairs? Enumerate paths: Too expensive! (Exponential..) Better: Iteration using abstraction Martin Stigge Workload Models + Analysis 30
56 Demand Triples Idea: Start with 0-paths (one vertex), extend stepwise We need: Abstraction which 1 allows to extend paths, 2 contains demand pair information, 3 without visiting/storing all paths Idea: Demand triples Execution demand e(π) Deadline d(π) Last vertex π l Demand triple e(π), d(π), π l is another abstraction! 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 Martin Stigge Workload Models + Analysis 31
57 Demand Triples Idea: Start with 0-paths (one vertex), extend stepwise We need: Abstraction which 1 allows to extend paths, 2 contains demand pair information, 3 without visiting/storing all paths Idea: Demand triples Execution demand e(π) Deadline d(π) Last vertex π l Demand triple e(π), d(π), π l is another abstraction! 2, 5 v , 8 v v 3 3, 8 v 4 5, Path (v 4 ) 5,, v 4 20 v 5 1, 5 Martin Stigge Workload Models + Analysis 31
58 Demand Triples Idea: Start with 0-paths (one vertex), extend stepwise We need: Abstraction which 1 allows to extend paths, 2 contains demand pair information, 3 without visiting/storing all paths Idea: Demand triples Execution demand e(π) Deadline d(π) Last vertex π l Demand triple e(π), d(π), π l is another abstraction! 2, 5 v , 8 v v 3 3, 8 v 4 5, Path (v 4 ) 5,, v 4 Path (v 4, v 2 ) 6, 28, v 2 20 v 5 1, 5 Martin Stigge Workload Models + Analysis 31
59 Demand Triples Idea: Start with 0-paths (one vertex), extend stepwise We need: Abstraction which 1 allows to extend paths, 2 contains demand pair information, 3 without visiting/storing all paths Idea: Demand triples Execution demand e(π) Deadline d(π) Last vertex π l Demand triple e(π), d(π), π l is another abstraction! 2, 5 v , 8 v v 5 v 3 3, 8 v 4 5, Path (v 4 ) 5,, v 4 Path (v 4, v 2 ) 6, 28, v 2 Path (v 4, v 2, v 3 ) 9, 43, v 3 1, 5 Martin Stigge Workload Models + Analysis 31
60 Iterative Procedure Create all demand triples up to some D: 1 Start with all 0-paths, i.e., e(v), d(v), v for all vertices v 2 Pick some stored demand triple e, d, u 3 Create new demand triple: Choose successor vertex v of u e = e + e(v) d = d d(u) + p(u, v) + d(v) e, d, v is new demand triple! 4 Store e, d, v if not stored yet, and d D 5 Repeat from 2 until no change Efficient procedure! Note: Actual paths never stored Optimizations: Discard non-critical triples along the way Exercise: What s dbf τi (26) for graph on previous slide? Martin Stigge Workload Models + Analysis 32
61 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Martin Stigge Workload Models + Analysis 33
62 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Martin Stigge Workload Models + Analysis 33
63 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Martin Stigge Workload Models + Analysis 33
64 Example dbf T (t) , 20, v 4 6 6, 30, v , 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Martin Stigge Workload Models + Analysis 33
65 Example dbf T (t) , 20, v 4 6 6, 30, v , 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Optimization: Discard dominated triples (e, d, v) (e, d, v) e e d d Martin Stigge Workload Models + Analysis 33
66 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Optimization: Discard dominated triples (e, d, v) (e, d, v) e e d d Martin Stigge Workload Models + Analysis 33
67 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Optimization: Discard dominated triples (e, d, v) (e, d, v) e e d d Martin Stigge Workload Models + Analysis 33
68 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Optimization: Discard dominated triples (e, d, v) (e, d, v) e e d d Martin Stigge Workload Models + Analysis 33
69 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Optimization: Discard dominated triples (e, d, v) (e, d, v) e e d d Martin Stigge Workload Models + Analysis 33
70 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Optimization: Discard dominated triples (e, d, v) (e, d, v) e e d d Martin Stigge Workload Models + Analysis 33
71 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Optimization: Discard dominated triples (e, d, v) (e, d, v) e e d d Martin Stigge Workload Models + Analysis 33
72 Example dbf T (t) 11 1, 8 15 v 3 3, 8 v , 5 v 1 20 v 4 5, 20 v 5 1, t D 70 Optimization: Discard dominated triples (e, d, v) (e, d, v) e e d d Martin Stigge Workload Models + Analysis 33
73 Feasibility Test Revisited Theorem (Feasibility Theorem) For a task set τ, the following three properties are equivalent. 1 Task set τ is feasible. 2 Task set τ is EDF schedulable. 3 The following condition holds: t 0 : T τ dbf T (t) t dbft (t) t 1 How to calculate dbf T (t)? 2 How to check existence of violating t? t Martin Stigge Workload Models + Analysis 34
74 Feasibility Test Revisited Theorem (Feasibility Theorem) For a task set τ, the following three properties are equivalent. 1 Task set τ is feasible. 2 Task set τ is EDF schedulable. 3 The following condition holds: t 0 : T τ dbf T (t) t dbft (t) t D t Martin Stigge Workload Models + Analysis 34
75 Calculating the Bound dbft (t) Most dense cycle Linear bound for dbf(t) dbf(t) J 2 J 3 J4 J 5 J 6 t J 1 J 8 J 7 Linear bound for dbf(t) Slope: Less than 1 Intersection with t gives bound D Check only up to D dbf(t) t U(τ) + e sum Martin Stigge Workload Models + Analysis 35
76 Calculating the Bound dbft (t) Most dense cycle Linear bound for dbf(t) dbf(t) J 2 J 3 J4 J 5 J 6 t J 1 J 8 J 7 Linear bound for dbf(t) Slope: Less than 1 Intersection with t gives bound D Check only up to D dbf(t) t U(τ) + e sum Martin Stigge Workload Models + Analysis 35
77 Calculating the Bound dbft (t) t Most dense cycle Linear bound for dbf(t) dbf(t) J 2 J 3 J4 J 5 J 6 D t J 1 J 8 J 7 Linear bound for dbf(t) Slope: Less than 1 Intersection with t gives bound D Check only up to D dbf(t) t U(τ) + e sum Martin Stigge Workload Models + Analysis 35
78 Complexity Result Theorem (S. et al., 2011) For DRT task systems τ with a utilization bounded by any c < 1, feasibility can be decided in pseudo-polynomial time. Pseudo-polynomial time = Tractable/efficient Martin Stigge Workload Models + Analysis 36
79 Evaluation: Runtime vs. Utilization Analysis Run-Time (seconds) EDF 0.0 0% 20% 40% 60% 80% 0% Task Set Utilization Setting: Randomly generated task sets 1-30 tasks, 5- vertices per task, branching degree 1-3,... Martin Stigge Workload Models + Analysis 37
80 Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic Tasks Frames and Branching The Digraph Real-Time (DRT) Task Model Adaptive Variable-Rate (AVR) Tasks 2 Feasibility Analysis of DRT Feasibility Theorem Demand Pairs Test Termination Evaluation 3 Static Priority Schedulability Analysis of DRT Response-Time Analysis Request Functions Refinement Algorithm Evaluation Martin Stigge Workload Models + Analysis 38
81 Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic Tasks Frames and Branching The Digraph Real-Time (DRT) Task Model Adaptive Variable-Rate (AVR) Tasks 2 Feasibility Analysis of DRT Feasibility Theorem Demand Pairs Test Termination Evaluation 3 Static Priority Schedulability Analysis of DRT Response-Time Analysis Request Functions Refinement Algorithm Evaluation Martin Stigge Workload Models + Analysis 38
82 Complexity of Schedulability Tests Pseudo-polynomial schedulability tests possible? EDF SP L&L Yes GMF Yes DRT Yes EDRT No Martin Stigge Workload Models + Analysis 39
83 Complexity of Schedulability Tests Pseudo-polynomial schedulability tests possible? = Takada & Sakamura, 1997 EDF SP L&L Yes Yes GMF Yes Yes DRT Yes? EDRT No? Martin Stigge Workload Models + Analysis 39
84 Complexity of Schedulability Tests Pseudo-polynomial schedulability tests possible? = Takada & Sakamura, 1997 Flawed! Replaced by: Theorem (S. et al., 2012) EDF SP L&L Yes Yes GMF Yes Yes No! DRT Yes No EDRT No No For GMF task systems, the schedulability problem for static priority schedulers is strongly conp-hard. Martin Stigge Workload Models + Analysis 39
85 Hardness Result: Proof Sketch 3-PARTITION instance I : m bins 3m items Possible to (exactly) fit all items? (strongly NP-hard) Reduction to GMF schedulability: Packing possible Busy interval t One GMF task for each item Thus: τ(i ) unsched. I 3-PARTITION Martin Stigge Workload Models + Analysis 40
86 Hardness Result: Proof Sketch 3-PARTITION instance I : m bins 3m items Possible to (exactly) fit all items? (strongly NP-hard) Reduction to GMF schedulability: Packing possible Busy interval t One GMF task for each item Thus: τ(i ) unsched. I 3-PARTITION Martin Stigge Workload Models + Analysis 40
87 Model Hierarchy Revisited conphard EDRT EDRT RRT k-edrt DRT ncrrt RRT k-edrt DRT ncrrt conphard p.p. RB GMF ncgmf RB GMF ncgmf MF sporadic MF sporadic p.p. L&L L&L EDF SP Martin Stigge Workload Models + Analysis 41
88 Response-Time Analysis (RTA) Use RTA for SP Schedulability Analysis. Response time Standard RTA for static priorities + periodic/sporadic tasks: R j = C j + Rj C i i hp(j) T i Martin Stigge Workload Models + Analysis 42
89 Problem: Path Combinations u3 u3 v3 v3 v2 u1 v2 u1 v1 v4 v1 v4 v5 u2 v5 u2 Response time Response time Martin Stigge Workload Models + Analysis 43
90 Problem: Path Combinations u3 u3 v3 v3 v2 u1 v2 u1 v1 v4 v1 v4 v5 u2 v5 u2 Response time Response time Combinatorial Explosion! Martin Stigge Workload Models + Analysis 43
91 Intuition: No Task-Local Worst Cases Task T high : 5 2, 5 v 1 v 2 6, Which path is worse: (v 1, v 2 ) or (v 2, v 1 )? Martin Stigge Workload Models + Analysis 44
92 Intuition: No Task-Local Worst Cases Task T high : 5 2, 5 v 1 v 2 6, Which path is worse: (v 1, v 2 ) or (v 2, v 1 )? It depends! T 1 : 2, 7 u versus T 2 : 4, w Martin Stigge Workload Models + Analysis 44
93 Intuition: No Task-Local Worst Cases Task T high : 5 2, 5 v 1 v 2 6, Which path is worse: (v 1, v 2 ) or (v 2, v 1 )? It depends! T 1 : 2, 7 u versus T 2 : 4, w v 1 v 2 v 2 v 1 T high : T high : T 1 : T 1 : Martin Stigge Workload Models + Analysis 44
94 Intuition: No Task-Local Worst Cases Task T high : 5 2, 5 v 1 v 2 6, Which path is worse: (v 1, v 2 ) or (v 2, v 1 )? It depends! T 1 : 2, 7 u versus T 2 : 4, w v 1 v 2 v 2 v 1 T high : T high : T 2 : T 2 : Martin Stigge Workload Models + Analysis 44
95 Request Functions 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 rf (t) rf 8 (v4,v 2,v 3 ) t rf π (t) := max { e(π ) π is prefix of π and p(π ) < t } Martin Stigge Workload Models + Analysis 45
96 Request Functions (cont.) Useful for deriving response time: { R SP (v, rf ) = min R SP (v) = max rf RF (τ) t 0 e(v) + R SP (v, rf ) T >T rf (T ) (t) t } Martin Stigge Workload Models + Analysis 46
97 Request Functions (cont.) Useful for deriving response time: { R SP (v, rf ) = min R SP (v) = max rf RF (τ) t 0 e(v) + R SP (v, rf ) T >T rf (T ) (t) t } Combinatorial Explosion?! Martin Stigge Workload Models + Analysis 46
98 Abstract Request Functions 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 rf (t) rf 8 (v4,v 2,v 3 ) t Martin Stigge Workload Models + Analysis 47
99 Abstract Request Functions 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 rf (t) 8 rf (v4,v 2,v 3 ) 6 4 rf (v5,v 4,v 2 ) 2 0 t Martin Stigge Workload Models + Analysis 47
100 Abstract Request Functions 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 rf (t) 8 arf rf (v4,v 2,v 3 ) 6 4 rf (v5,v 4,v 2 ) 2 0 t Martin Stigge Workload Models + Analysis 47
101 Abstraction Tree rf 1 rf 2 rf 3 rf 4 rf 5 Define an abstraction tree per task: Leaves are concrete rf Each node: maximum function of child nodes Root is maximum of all rf Martin Stigge Workload Models + Analysis 48
102 Abstraction Tree rf 1 rf 2 rf 3 rf 4 rf 5 Define an abstraction tree per task: Leaves are concrete rf Each node: maximum function of child nodes Root is maximum of all rf Martin Stigge Workload Models + Analysis 48
103 Abstraction Tree rf 1 rf 2 rf 3 rf 4 rf 5 Define an abstraction tree per task: Leaves are concrete rf Each node: maximum function of child nodes Root is maximum of all rf Martin Stigge Workload Models + Analysis 48
104 Abstraction Tree rf 1 rf 2 rf 3 rf 4 rf 5 Define an abstraction tree per task: Leaves are concrete rf Each node: maximum function of child nodes Root is maximum of all rf Martin Stigge Workload Models + Analysis 48
105 Abstraction Tree rf 1 rf 2 rf 3 rf 4 rf 5 Define an abstraction tree per task: Leaves are concrete rf Each node: maximum function of child nodes Root is maximum of all rf Martin Stigge Workload Models + Analysis 48
106 Abstraction Tree rf 1 rf 2 rf 3 rf 4 rf 5 Define an abstraction tree per task: Leaves are concrete rf Each node: maximum function of child nodes Root is maximum of all rf Allows stepwise refinement! Martin Stigge Workload Models + Analysis 48
107 Refinement Algorithm Store Tuple: rf = (rf (T 1), rf (T 2), rf (T 3) ) Martin Stigge Workload Models + Analysis 49
108 Refinement Algorithm Tuple: rf = (rf (T 1), rf (T 2), rf (T 3) ) Store (23, rf 1 ) Response time: R SP (v, rf ) = 23 Using: R SP (v, rf { ) = min t 0 e(v) + T >T rf (T ) } (t) t Martin Stigge Workload Models + Analysis 49
109 Refinement Algorithm Store (23, rf 1 ) Martin Stigge Workload Models + Analysis 49
110 Refinement Algorithm Step: rf 1 = (rf (T 1), rf (T 2), rf (T 3) ) Store (23, rf 1 ) rf 2 = (rf (T 1), rf (T 2), rf (T 3) ) rf 3 = (rf (T 1), rf (T 2), rf (T 3) ) In T 1 : rf rf rf Martin Stigge Workload Models + Analysis 49
111 Refinement Algorithm Step: rf 1 = (rf (T 1), rf (T 2), rf (T 3) ) Store (23, rf 1 ) rf 2 = (rf (T 1), rf (T 2), rf (T 3) ) rf 3 = (rf (T 1), rf (T 2), rf (T 3) ) In T 1 : rf rf rf Martin Stigge Workload Models + Analysis 49
112 Refinement Algorithm Step: rf 1 = (rf (T 1), rf (T 2), rf (T 3) ) rf 2 = (rf (T 1), rf (T 2), rf (T 3) ) rf 3 = (rf (T 1), rf (T 2), rf (T 3) ) Store (23, rf 1 ) (21, rf 2 ) (18, rf 3 ) In T 1 : rf rf rf Martin Stigge Workload Models + Analysis 49
113 Refinement Algorithm Store (21, rf 2 ) (18, rf 3 ) Martin Stigge Workload Models + Analysis 49
114 Refinement Algorithm Step: rf 2 = (rf (T 1), rf (T 2), rf (T 3) ) Store (21, rf 2 ) (18, rf 3 ) Martin Stigge Workload Models + Analysis 49
115 Refinement Algorithm Step: rf 2 = (rf (T 1), rf (T 2), rf (T 3) ) Store (21, rf 2 ) (18, rf 3 ) rf 4 = (rf (T 1), rf (T 2), rf (T 3) ) rf 5 = (rf (T 1), rf (T 2), rf (T 3) ) In T 2 : rf rf rf Martin Stigge Workload Models + Analysis 49
116 Refinement Algorithm Step: rf 2 = (rf (T 1), rf (T 2), rf (T 3) ) Store (21, rf 2 ) (18, rf 3 ) rf 4 = (rf (T 1), rf (T 2), rf (T 3) ) rf 5 = (rf (T 1), rf (T 2), rf (T 3) ) In T 2 : rf rf rf Martin Stigge Workload Models + Analysis 49
117 Refinement Algorithm Step: rf 2 = (rf (T 1), rf (T 2), rf (T 3) ) rf 4 = (rf (T 1), rf (T 2), rf (T 3) ) rf 5 = (rf (T 1), rf (T 2), rf (T 3) ) Store (21, rf 2 ) (20, rf 4 ) (18, rf 3 ) (17, rf 5 ) In T 2 : rf rf rf Martin Stigge Workload Models + Analysis 49
118 Refinement Algorithm Store (20, rf 4 ) (18, rf 3 ) (17, rf 5 ). Martin Stigge Workload Models + Analysis 49
119 Refinement Algorithm Initialization: Most abstract functions Each iteration: Replace functions along abstraction trees Termination: All functions are concrete OR: Estimate is already safe Store (20, rf 4 ) (18, rf 3 ) (17, rf 5 ). Martin Stigge Workload Models + Analysis 49
120 Refinement Algorithm Initialization: Most abstract functions Each iteration: Replace functions along abstraction trees Termination: All functions are concrete OR: Estimate is already safe Store (20, rf 4 ) (18, rf 3 ) (17, rf 5 ). Martin Stigge Workload Models + Analysis 49
121 Evaluation: Run-time Scaling Analysis Run-Time (seconds) EDF SP 0.0 0% 20% 40% 60% 80% 0% Task Set Utilization 1-30 tasks with 5- vertices each, branching degree 1-3 Martin Stigge Workload Models + Analysis 50
122 Evaluation: Precision Improvement Average improvement 20% 15% % 5% Type A Type B 0% 20% 40% 60% 80% 0% Fraction of improved RT estimates Type A: lower parameter variance Type B: higher parameter variance Martin Stigge Workload Models + Analysis 51
123 Generality Exact solution for NP-hard problem Efficient method Iterative refinement General! Apply to any combinatorial problem... with monotonic abstraction lattice rf 1 rf 2 rf 5 rf 3 rf 4 Martin Stigge Workload Models + Analysis 52
124 Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic Tasks Frames and Branching The Digraph Real-Time (DRT) Task Model Adaptive Variable-Rate (AVR) Tasks 2 Feasibility Analysis of DRT Feasibility Theorem Demand Pairs Test Termination Evaluation 3 Static Priority Schedulability Analysis of DRT Response-Time Analysis Request Functions Refinement Algorithm Evaluation Martin Stigge Workload Models + Analysis 53
125 Summary RRT RB GMF MF ncrrt ncgmf sporadic L&L Martin Stigge Workload Models + Analysis 54
126 Summary EDRT k-edrt RRT RB GMF MF DRT ncrrt ncgmf sporadic L&L Martin Stigge Workload Models + Analysis 54
127 Summary conphard EDRT k-edrt p.p. RRT RB GMF MF DRT ncrrt ncgmf sporadic L&L EDF Martin Stigge Workload Models + Analysis 54
128 Summary conphard EDRT EDRT RRT k-edrt DRT ncrrt RRT k-edrt DRT ncrrt conphard p.p. RB GMF ncgmf RB GMF ncgmf MF sporadic MF sporadic p.p. L&L L&L EDF SP Martin Stigge Workload Models + Analysis 54
129 Summary conphard EDRT EDRT RRT k-edrt DRT ncrrt RRT k-edrt DRT ncrrt conphard p.p. RB GMF ncgmf RB GMF ncgmf MF sporadic MF sporadic p.p. L&L L&L EDF SP Martin Stigge Workload Models + Analysis 54
130 Q & A Thanks! Martin Stigge Workload Models + Analysis 55
131 Backup Slides Coming Up... Martin Stigge Workload Models + Analysis 56
132 Path Abstractions: SP + EDF Martin Stigge Workload Models + Analysis 57
133 Path Abstractions: Static Priorities 11 1, 8 15 v 3 3, 8 2, 5 v 1 v v 4 5, 20 v 5 1, 5 rf (t) rf 8 (v4,v 2,v 3 ) t rf π (t) := max { e(π ) π is prefix of π and p(π ) < t } Martin Stigge Workload Models + Analysis 58
134 Path Abstractions: EDF T 1 v T 2 v Martin Stigge Workload Models + Analysis 59
135 Path Abstractions: EDF T 1 v t T 2 v t wf π (t, t ) := max{e(π ) π is prefix of π, p(π ) < t and d(π ) t }. Martin Stigge Workload Models + Analysis 59
Lecture: Workload Models (Advanced Topic)
Lecture: Workload Models (Advanced Topic) Real-Time Systems, HT11 Martin Stigge 28. September 2011 Martin Stigge Workload Models 28. September 2011 1 System
More informationComplexity of Uniprocessor Scheduling Analysis
Complexity of Uniprocessor Scheduling Analysis Pontus Ekberg and Wang Yi Abstract When designing a real-time system, a schedulability problem must be solved in order to show that it will meet all timing
More informationResource Sharing Protocols for Real-Time Task Graph Systems
Resource Sharing Protocols for Real-Time Task Graph Systems Nan Guan, Pontus Ekberg, Martin Stigge, Wang Yi Uppsala University, Sweden Northeastern University, China Abstract Previous works on real-time
More informationNon-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund
Non-Preemptive and Limited Preemptive Scheduling LS 12, TU Dortmund 09 May 2017 (LS 12, TU Dortmund) 1 / 31 Outline Non-Preemptive Scheduling A General View Exact Schedulability Test Pessimistic Schedulability
More informationThe Partitioned Dynamic-priority Scheduling of Sporadic Task Systems
The Partitioned Dynamic-priority Scheduling of Sporadic Task Systems Abstract A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical
More informationMultiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling I: Partitioned Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 22/23, June, 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 47 Outline Introduction to Multiprocessor
More informationPaper Presentation. Amo Guangmo Tong. University of Taxes at Dallas February 11, 2014
Paper Presentation Amo Guangmo Tong University of Taxes at Dallas gxt140030@utdallas.edu February 11, 2014 Amo Guangmo Tong (UTD) February 11, 2014 1 / 26 Overview 1 Techniques for Multiprocessor Global
More informationBounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks
Bounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks Pontus Ekberg and Wang Yi Uppsala University, Sweden Email: {pontus.ekberg yi}@it.uu.se Abstract We derive demand-bound functions for
More informationLecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013
Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S
More informationRUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES
RUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES Department for Embedded Systems/Real-Time Systems, University of Ulm {name.surname}@informatik.uni-ulm.de Abstract:
More informationScheduling Periodic Real-Time Tasks on Uniprocessor Systems. LS 12, TU Dortmund
Scheduling Periodic Real-Time Tasks on Uniprocessor Systems Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 08, Dec., 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 38 Periodic Control System Pseudo-code
More informationReal-time scheduling of sporadic task systems when the number of distinct task types is small
Real-time scheduling of sporadic task systems when the number of distinct task types is small Sanjoy Baruah Nathan Fisher Abstract In some real-time application systems, there are only a few distinct kinds
More informationSchedulability and Optimization Analysis for Non-Preemptive Static Priority Scheduling Based on Task Utilization and Blocking Factors
Schedulability and Optimization Analysis for Non-Preemptive Static Priority Scheduling Based on Task Utilization and Blocking Factors Georg von der Brüggen, Jian-Jia Chen, Wen-Hung Huang Department of
More informationSchedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems
Schedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems Jan Reineke Saarland University July 4, 2013 With thanks to Jian-Jia Chen! Jan Reineke July 4, 2013 1 / 58 Task Models and Scheduling
More informationTime and Schedulability Analysis of Stateflow Models
Time and Schedulability Analysis of Stateflow Models Marco Di Natale Scuola Superiore S. Anna Haibo Zeng Mc Gill University Outline Context: MBD of Embedded Systems Relationship with PBD An Introduction
More informationEDF Scheduling. Giuseppe Lipari May 11, Scuola Superiore Sant Anna Pisa
EDF Scheduling Giuseppe Lipari http://feanor.sssup.it/~lipari Scuola Superiore Sant Anna Pisa May 11, 2008 Outline 1 Dynamic priority 2 Basic analysis 3 FP vs EDF 4 Processor demand bound analysis Generalization
More informationReal-Time Scheduling and Resource Management
ARTIST2 Summer School 2008 in Europe Autrans (near Grenoble), France September 8-12, 2008 Real-Time Scheduling and Resource Management Lecturer: Giorgio Buttazzo Full Professor Scuola Superiore Sant Anna
More informationIN4343 Real Time Systems April 9th 2014, from 9:00 to 12:00
TECHNISCHE UNIVERSITEIT DELFT Faculteit Elektrotechniek, Wiskunde en Informatica IN4343 Real Time Systems April 9th 2014, from 9:00 to 12:00 Koen Langendoen Marco Zuniga Question: 1 2 3 4 5 Total Points:
More informationUtilization Bounds on Allocating Rate-Monotonic Scheduled Multi-Mode Tasks on Multiprocessor Systems
Utilization Bounds on Allocating Rate-onotonic Scheduled ulti-ode Tasks on ultiprocessor Systems Wen-Hung Huang Department of Computer Science TU Dortmund University, Germany wen-hung.huang@tu-dortmund.de
More informationEmbedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i
Embedded Systems 15-1 - REVIEW: Aperiodic scheduling C i J i 0 a i s i f i d i Given: A set of non-periodic tasks {J 1,, J n } with arrival times a i, deadlines d i, computation times C i precedence constraints
More informationEmbedded Systems Development
Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs
More informationMultiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling II: Global Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 28, June, 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 42 Global Scheduling We will only focus on identical
More informationReal-Time Systems. Lecture #14. Risat Pathan. Department of Computer Science and Engineering Chalmers University of Technology
Real-Time Systems Lecture #14 Risat Pathan Department of Computer Science and Engineering Chalmers University of Technology Real-Time Systems Specification Implementation Multiprocessor scheduling -- Partitioned
More informationThe Feasibility Analysis of Multiprocessor Real-Time Systems
The Feasibility Analysis of Multiprocessor Real-Time Systems Sanjoy Baruah Nathan Fisher The University of North Carolina at Chapel Hill Abstract The multiprocessor scheduling of collections of real-time
More informationEDF Scheduling. Giuseppe Lipari CRIStAL - Université de Lille 1. October 4, 2015
EDF Scheduling Giuseppe Lipari http://www.lifl.fr/~lipari CRIStAL - Université de Lille 1 October 4, 2015 G. Lipari (CRIStAL) Earliest Deadline Scheduling October 4, 2015 1 / 61 Earliest Deadline First
More informationSchedulability analysis of global Deadline-Monotonic scheduling
Schedulability analysis of global Deadline-Monotonic scheduling Sanjoy Baruah Abstract The multiprocessor Deadline-Monotonic (DM) scheduling of sporadic task systems is studied. A new sufficient schedulability
More informationTask Models and Scheduling
Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling
More informationarxiv: v1 [cs.os] 6 Jun 2013
Partitioned scheduling of multimode multiprocessor real-time systems with temporal isolation Joël Goossens Pascal Richard arxiv:1306.1316v1 [cs.os] 6 Jun 2013 Abstract We consider the partitioned scheduling
More informationStatic priority scheduling
Static priority scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017 Some slides are derived from lectures
More informationEmbedded Systems 14. Overview of embedded systems design
Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The
More informationNon-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions
Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions Mitra Nasri Chair of Real-time Systems, Technische Universität Kaiserslautern, Germany nasri@eit.uni-kl.de
More informationClock-driven scheduling
Clock-driven scheduling Also known as static or off-line scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017
More informationMitra Nasri* Morteza Mohaqeqi Gerhard Fohler
Mitra Nasri* Morteza Mohaqeqi Gerhard Fohler RTNS, October 2016 Since 1973 it is known that period ratio affects the RM Schedulability The hardest-to-schedule task set [Liu and Layland] T 2 T n T 1 T 2
More informationPartitioned scheduling of sporadic task systems: an ILP-based approach
Partitioned scheduling of sporadic task systems: an ILP-based approach Sanjoy K. Baruah The University of North Carolina Chapel Hill, NC. USA Enrico Bini Scuola Superiore Santa Anna Pisa, Italy. Abstract
More informationAn Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks
An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks Sandeep Kumar Bijinemula *, Aaron Willcock, Thidapat Chantem *, Nathan Fisher * Department of Electrical and Computer
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationAS computer hardware technology advances, both
1 Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources Chunhui Guo, Student Member, IEEE, Xiayu Hua, Student Member, IEEE, Hao Wu, Student Member, IEEE, Douglas Lautner,
More informationImproved Priority Assignment for the Abort-and-Restart (AR) Model
Improved Priority Assignment for the Abort-and-Restart (AR) Model H.C. Wong and A. Burns Department of Computer Science, University of York, UK. February 1, 2013 Abstract This paper addresses the scheduling
More informationLoad Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors
Technical Report No. 2009-7 Load Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors RISAT MAHMUD PATHAN JAN JONSSON Department of Computer Science and Engineering CHALMERS UNIVERSITY
More informationModeling and Analysis of Engine Control Tasks Under Dynamic Priority Scheduling
Modeling and Analysis of Engine Control Tasks Under Dynamic Priority Scheduling Alessandro Biondi and Giorgio Buttazzo Scuola Superiore Sant Anna, Pisa, Italy Email: {alessandro.biondi, giorgio.buttazzo}@santannapisa.it
More informationA New Task Model and Utilization Bound for Uniform Multiprocessors
A New Task Model and Utilization Bound for Uniform Multiprocessors Shelby Funk Department of Computer Science, The University of Georgia Email: shelby@cs.uga.edu Abstract This paper introduces a new model
More informationA New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets Abstract The problem of feasibility analysis for asynchronous periodic task sets (ie where tasks can have an initial offset
More informationThe Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities Nathan Fisher Sanjoy Baruah The University of North Carolina at Chapel Hill Department of Computer Science, CB-3175 Chapel Hill,
More informationReal-Time and Embedded Systems (M) Lecture 5
Priority-driven Scheduling of Periodic Tasks (1) Real-Time and Embedded Systems (M) Lecture 5 Lecture Outline Assumptions Fixed-priority algorithms Rate monotonic Deadline monotonic Dynamic-priority algorithms
More informationSchedule Table Generation for Time-Triggered Mixed Criticality Systems
Schedule Table Generation for Time-Triggered Mixed Criticality Systems Jens Theis and Gerhard Fohler Technische Universität Kaiserslautern, Germany Sanjoy Baruah The University of North Carolina, Chapel
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationAperiodic Task Scheduling
Aperiodic Task Scheduling Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2017 年 11 月 29 日 These slides use Microsoft clip arts. Microsoft copyright
More informationAverage-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints
Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Keqin Li Department of Computer Science State University of New York New Paltz, New
More informationIntroduction to Bin Packing Problems
Introduction to Bin Packing Problems Fabio Furini March 13, 2015 Outline Origins and applications Applications: Definition: Bin Packing Problem (BPP) Solution techniques for the BPP Heuristic Algorithms
More informationAndrew Morton University of Waterloo Canada
EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo Canada Outline 1) Introduction and motivation 2) Review of EDF and feasibility analysis 3) Hardware accelerators and scheduling
More informationOptimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors. Sanjoy K.
Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors Sanjoy K. Baruah Abstract In fixed-priority scheduling the priority of a job, once assigned,
More informationNetworked Embedded Systems WS 2016/17
Networked Embedded Systems WS 2016/17 Lecture 2: Real-time Scheduling Marco Zimmerling Goal of Today s Lecture Introduction to scheduling of compute tasks on a single processor Tasks need to finish before
More informationNon-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks
Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks Moonju Park Ubiquitous Computing Lab., IBM Korea, Seoul, Korea mjupark@kr.ibm.com Abstract. This paper addresses the problem of
More informationMulti-core Real-Time Scheduling for Generalized Parallel Task Models
Washington University in St. Louis Washington University Open Scholarship All Computer Science and Engineering Research Computer Science and Engineering Report Number: WUCSE-011-45 011 Multi-core Real-Time
More informationBounding the Maximum Length of Non-Preemptive Regions Under Fixed Priority Scheduling
Bounding the Maximum Length of Non-Preemptive Regions Under Fixed Priority Scheduling Gang Yao, Giorgio Buttazzo and Marko Bertogna Scuola Superiore Sant Anna, Pisa, Italy {g.yao, g.buttazzo, m.bertogna}@sssup.it
More informationCEC 450 Real-Time Systems
CEC 450 Real-Time Systems Lecture 3 Real-Time Services Part 2 (Rate Monotonic Theory - Policy and Feasibility for RT Services) September 7, 2018 Sam Siewert Quick Review Service Utility RM Policy, Feasibility,
More informationResource-locking durations in EDF-scheduled systems
Resource-locking durations in EDF-scheduled systems Nathan Fisher Marko Bertogna Sanjoy Baruah Abstract The duration of time for which each application locks each shared resource is critically important
More informationTask assignment in heterogeneous multiprocessor platforms
Task assignment in heterogeneous multiprocessor platforms Sanjoy K. Baruah Shelby Funk The University of North Carolina Abstract In the partitioned approach to scheduling periodic tasks upon multiprocessors,
More informationReal-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2
Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Lecture Outline Scheduling periodic tasks The rate monotonic algorithm Definition Non-optimality Time-demand analysis...!2
More informationExact Scheduling Analysis of Non-Accumulatively Monotonic Multiframe Tasks
Exact Scheduling Analysis of Non-Accumulatively Monotonic Multiframe Tasks A. Zuhily, Alan Burns To cite this version: A. Zuhily, Alan Burns. Exact Scheduling Analysis of Non-Accumulatively Monotonic Multiframe
More information3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions
Common approaches 3 3. Scheduling issues Priority-driven (event-driven) scheduling This class of algorithms is greedy They never leave available processing resources unutilized An available resource may
More informationReal-Time Calculus. LS 12, TU Dortmund
Real-Time Calculus Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 09, Dec., 2014 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 35 Arbitrary Deadlines The worst-case response time of τ i by only considering
More informationarxiv: v1 [cs.os] 28 Feb 2018
Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Tas Systems Jian-Jia Chen 1, Georg von der Brüggen 2, and Nilas Ueter 3 1 TU Dortmund University, Germany jian-jian.chen@tu-dortmund.de
More informationExact Interference of Adaptive Variable-Rate Tasks under Fixed-Priority Scheduling
Proceedings of the 26th Euromicro Conference on Real-Time Systems (ECRTS 2014), Madrid, Spain, July 8-11, 2014. Exact Interference of Adaptive Variable-Rate Tasks under Fixed-Priority Scheduling Alessandro
More informationScheduling mixed-criticality systems to guarantee some service under all non-erroneous behaviors
Consistent * Complete * Well Documented * Easy to Reuse * Scheduling mixed-criticality systems to guarantee some service under all non-erroneous behaviors Artifact * AE * Evaluated * ECRTS * Sanjoy Baruah
More informationGlobal mixed-criticality scheduling on multiprocessors
Global mixed-criticality scheduling on multiprocessors Haohan Li Sanjoy Baruah The University of North Carolina at Chapel Hill Abstract The scheduling of mixed-criticality implicit-deadline sporadic task
More informationarxiv: v3 [cs.ds] 23 Sep 2016
Evaluate and Compare Two Utilization-Based Schedulability-Test Framewors for Real-Time Systems arxiv:1505.02155v3 [cs.ds] 23 Sep 2016 Jian-Jia Chen and Wen-Hung Huang Department of Informatics TU Dortmund
More informationReal-Time Systems. Event-Driven Scheduling
Real-Time Systems Event-Driven Scheduling Hermann Härtig WS 2018/19 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed Priority schedulers
More informationScheduling and Analysis of Real-Time OpenMP Task Systems with Tied Tasks
Scheduling and Analysis of Real-Time OpenMP Task Systems with Tied Tasks Jinghao Sun 1,2, Nan Guan 2, Yang Wang 1, Qingqing He 1 and Wang Yi 1,3 1 Northeastern University, China 2 The Hong Kong Polytechnic
More informationSystem Model. Real-Time systems. Giuseppe Lipari. Scuola Superiore Sant Anna Pisa -Italy
Real-Time systems System Model Giuseppe Lipari Scuola Superiore Sant Anna Pisa -Italy Corso di Sistemi in tempo reale Laurea Specialistica in Ingegneria dell Informazione Università di Pisa p. 1/?? Task
More information4. How to prove a problem is NPC
The reducibility relation T is transitive, i.e, A T B and B T C imply A T C Therefore, to prove that a problem A is NPC: (1) show that A NP (2) choose some known NPC problem B define a polynomial transformation
More informationarxiv: v1 [cs.os] 21 May 2008
Integrating job parallelism in real-time scheduling theory Sébastien Collette Liliana Cucu Joël Goossens arxiv:0805.3237v1 [cs.os] 21 May 2008 Abstract We investigate the global scheduling of sporadic,
More informationA Theory of Rate-Based Execution. A Theory of Rate-Based Execution
Kevin Jeffay Department of Computer Science University of North Carolina at Chapel Hill jeffay@cs cs.unc.edu Steve Goddard Computer Science & Engineering University of Nebraska Ð Lincoln goddard@cse cse.unl.edu
More informationDiscrete Optimization 2010 Lecture 2 Matroids & Shortest Paths
Matroids Shortest Paths Discrete Optimization 2010 Lecture 2 Matroids & Shortest Paths Marc Uetz University of Twente m.uetz@utwente.nl Lecture 2: sheet 1 / 25 Marc Uetz Discrete Optimization Matroids
More informationAlgorithms. Outline! Approximation Algorithms. The class APX. The intelligence behind the hardware. ! Based on
6117CIT - Adv Topics in Computing Sci at Nathan 1 Algorithms The intelligence behind the hardware Outline! Approximation Algorithms The class APX! Some complexity classes, like PTAS and FPTAS! Illustration
More informationSchedulability Analysis of the Linux Push and Pull Scheduler with Arbitrary Processor Affinities
Revision 1 July 23, 215 Schedulability Analysis of the Linux Push and Pull Scheduler with Arbitrary Processor Affinities Arpan Gujarati Felipe Cerqueira Björn B. Brandenburg Max Planck Institute for Software
More informationEDF Feasibility and Hardware Accelerators
EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo, Waterloo, Canada, arrmorton@uwaterloo.ca Wayne M. Loucks University of Waterloo, Waterloo, Canada, wmloucks@pads.uwaterloo.ca
More informationMulti-core Real-Time Scheduling for Generalized Parallel Task Models
Noname manuscript No. (will be inserted by the editor) Multi-core Real-Time Scheduling for Generalized Parallel Task Models Abusayeed Saifullah Jing Li Kunal Agrawal Chenyang Lu Christopher Gill Received:
More informationLecture 6. Real-Time Systems. Dynamic Priority Scheduling
Real-Time Systems Lecture 6 Dynamic Priority Scheduling Online scheduling with dynamic priorities: Earliest Deadline First scheduling CPU utilization bound Optimality and comparison with RM: Schedulability
More informationData Structures in Java
Data Structures in Java Lecture 21: Introduction to NP-Completeness 12/9/2015 Daniel Bauer Algorithms and Problem Solving Purpose of algorithms: find solutions to problems. Data Structures provide ways
More informationEECS 571 Principles of Real-Time Embedded Systems. Lecture Note #7: More on Uniprocessor Scheduling
EECS 571 Principles of Real-Time Embedded Systems Lecture Note #7: More on Uniprocessor Scheduling Kang G. Shin EECS Department University of Michigan Precedence and Exclusion Constraints Thus far, we
More informationThis means that we can assume each list ) is
This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible
More informationExact speedup factors and sub-optimality for non-preemptive scheduling
Real-Time Syst (2018) 54:208 246 https://doi.org/10.1007/s11241-017-9294-3 Exact speedup factors and sub-optimality for non-preemptive scheduling Robert I. Davis 1 Abhilash Thekkilakattil 2 Oliver Gettings
More informationAlgorithms. NP -Complete Problems. Dong Kyue Kim Hanyang University
Algorithms NP -Complete Problems Dong Kyue Kim Hanyang University dqkim@hanyang.ac.kr The Class P Definition 13.2 Polynomially bounded An algorithm is said to be polynomially bounded if its worst-case
More informationAlgorithm Design Strategies V
Algorithm Design Strategies V Joaquim Madeira Version 0.0 October 2016 U. Aveiro, October 2016 1 Overview The 0-1 Knapsack Problem Revisited The Fractional Knapsack Problem Greedy Algorithms Example Coin
More informationSegment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks
Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Junsung Kim, Björn Andersson, Dionisio de Niz, and Raj Rajkumar Carnegie Mellon University 2/31 Motion Planning on Self-driving Parallel
More informationStatic-Priority Scheduling. CSCE 990: Real-Time Systems. Steve Goddard. Static-priority Scheduling
CSCE 990: Real-Time Systems Static-Priority Scheduling Steve Goddard goddard@cse.unl.edu http://www.cse.unl.edu/~goddard/courses/realtimesystems Static-priority Scheduling Real-Time Systems Static-Priority
More informationCPU SCHEDULING RONG ZHENG
CPU SCHEDULING RONG ZHENG OVERVIEW Why scheduling? Non-preemptive vs Preemptive policies FCFS, SJF, Round robin, multilevel queues with feedback, guaranteed scheduling 2 SHORT-TERM, MID-TERM, LONG- TERM
More informationReal-Time Systems. Event-Driven Scheduling
Real-Time Systems Event-Driven Scheduling Marcus Völp, Hermann Härtig WS 2013/14 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed
More informationFixed Priority Scheduling
Fixed Priority Scheduling Giuseppe Lipari http://feanor.sssup.it/~lipari Scuola Superiore Sant Anna Pisa January 13, 2011 Outline 1 Fixed priority 2 Priority assignment 3 Scheduling analysis 4 A necessary
More informationPolynomial-time Reductions
Polynomial-time Reductions Disclaimer: Many denitions in these slides should be taken as the intuitive meaning, as the precise meaning of some of the terms are hard to pin down without introducing the
More informationCS 374: Algorithms & Models of Computation, Spring 2017 Greedy Algorithms Lecture 19 April 4, 2017 Chandra Chekuri (UIUC) CS374 1 Spring / 1
CS 374: Algorithms & Models of Computation, Spring 2017 Greedy Algorithms Lecture 19 April 4, 2017 Chandra Chekuri (UIUC) CS374 1 Spring 2017 1 / 1 Part I Greedy Algorithms: Tools and Techniques Chandra
More informationReal-Time Systems. Lecture 4. Scheduling basics. Task scheduling - basic taxonomy Basic scheduling techniques Static cyclic scheduling
Real-Time Systems Lecture 4 Scheduling basics Task scheduling - basic taxonomy Basic scheduling techniques Static cyclic scheduling 1 Last lecture (3) Real-time kernels The task states States and transition
More informationIntroduction to Algorithms
Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 18 Prof. Erik Demaine Negative-weight cycles Recall: If a graph G = (V, E) contains a negativeweight cycle, then some shortest paths may not exist.
More informationSpecial Nodes for Interface
fi fi Special Nodes for Interface SW on processors Chip-level HW Board-level HW fi fi C code VHDL VHDL code retargetable compilation high-level synthesis SW costs HW costs partitioning (solve ILP) cluster
More informationQuasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks Luis Alejandro Cortés, Petru Eles, and Zebo Peng Embedded Systems Laboratory Department of Computer and Information
More informationA Note on Modeling Self-Suspending Time as Blocking Time in Real-Time Systems
A Note on Modeling Self-Suspending Time as Blocking Time in Real-Time Systems Jian-Jia Chen 1, Wen-Hung Huang 1, and Geoffrey Nelissen 2 1 TU Dortmund University, Germany Email: jian-jia.chen@tu-dortmund.de,
More informationA Response-Time Analysis for Non-preemptive Job Sets under Global Scheduling
A Response-Time Analysis for Non-preemptive Job Sets under Global Scheduling Mitra Nasri 1, Geoffrey Nelissen 2, and Björn B. Brandenburg 1 1 Max Planck Institute for Software Systems (MPI-SWS), Germany
More informationMultiprocessor Scheduling of Age Constraint Processes
Multiprocessor Scheduling of Age Constraint Processes Lars Lundberg Department of Computer Science, University of Karlskrona/Ronneby, Soft Center, S-372 25 Ronneby, Sweden, email: Lars.Lundberg@ide.hk-r.se
More informationA Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks Krishnendu Chatterjee 1, Andreas Pavlogiannis 1, Alexander Kößler 2, Ulrich Schmid 2 1 IST Austria, 2 TU Wien
More information