Scheduling Periodic Real-Time Tasks on Uniprocessor Systems. LS 12, TU Dortmund
|
|
- Geraldine Crawford
- 5 years ago
- Views:
Transcription
1 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
2 Periodic Control System Pseudo-code for this system Control System set timer to interrupt periodically with period T ; A/D yk Control law computation uk D/A at each timer interrupt do perform analog-to-digital conversion to get y; y(t) sensor plant (The system being controlled) u(t) actuator compute control output u; output u and do digital-to-analog conversion; od Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 2 / 38
3 Example: Sporadic Control System Pseudo-code for this system Control System while (true) start := get the system tick; perform analog-to-digital conversion to get y; compute control output u; A/D y(t) sensor yk Control law computation plant (The system being controlled) uk D/A u(t) actuator output u and do digital-to-analog conversion; end := get the system tick; timetosleep := T (end start); sleep timetosleep; end while Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 3 / 38
4 Periodic and Sporadic Task Models When jobs (usually with the same computation requirement) are released recurrently, these jobs can be modeled by a recurrent task Periodic Task τ i : A job is released exactly and periodically by a period T i A phase φ i indicates when the first job is released A relative deadline D i for each job from task τ i (φ i, C i, T i, D i ) is the specification of periodic task τ i, where C i is the worst-case execution time. When φ i is omitted, we assume φ i is 0. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 4 / 38
5 Periodic and Sporadic Task Models When jobs (usually with the same computation requirement) are released recurrently, these jobs can be modeled by a recurrent task Periodic Task τ i : A job is released exactly and periodically by a period T i A phase φ i indicates when the first job is released A relative deadline D i for each job from task τ i (φ i, C i, T i, D i ) is the specification of periodic task τ i, where C i is the worst-case execution time. When φ i is omitted, we assume φ i is 0. Sporadic Task τ i : T i is the minimal time between any two consecutive job releases A relative deadline D i for each job from task τ i (C i, T i, D i ) is the specification of sporadic task τ i, where C i is the worst-case execution time. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 4 / 38
6 Examples of Recurrent Task Models Periodic task: (φ i, C i, T i, D i ) = (2, 2, 6, 6) release deadline J 1 J 1 J 1 J 1 J Sporadic task: (C i, T i, D i ) = (2, 6, 6) J 1 J 1 J 1 J Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 5 / 38
7 Relative Deadline <=> Period For a task set, we say that the task set is with implicit deadline when the relative deadline D i is equal to the period T i, i.e., D i = T i, for every task τ i, constrained deadline when the relative deadline D i is no more than the period T i, i.e., D i T i, for every task τ i, or arbitrary deadline when the relative deadline D i could be larger than the period T i for some task τ i. The response time of a job is its finishing time minus its arrival time. The worst-case response time of task τ i is the maximum response time among the jobs of task τ i. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 6 / 38
8 Some Definitions for Sporadic/Periodic Tasks Periodic Tasks: Synchronous system: Each task has a phase of 0. Asynchronous system: Phases are arbitrary. Hyperperiod: Least common multiple (LCM) of T i. Task utilization of task τ i : U i := C i T i. System (total) utilization: U(T ) := τ i T U i. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 7 / 38
9 Outline Schedulability for Dynamic-Priority Scheduling Schedulability for Static-Priority (or Fixed-Priority) Scheduling Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 8 / 38
10 Utilization-Based Test for EDF Scheduling Theorem Liu and Layland: A task set T of n independent, preemptable, periodic tasks with implicit deadlines can be feasibly scheduled (under EDF) on one processor if and only if its total utilization U is at most one. Proof The only if part is obvious: If U > 1, then some task clearly must miss a deadline. So, we concentrate on the if part. Contrapositive: if T is not schedulable, then U > 1. Let J i,k be the first job to miss its deadline Let d i,k be the absolute deadline of J i,k Let t 1 be the last instant before d i,k, at which the processor is either idle or executing a job with absolute deadline larger than d i,k (cont.) Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 9 / 38
11 Proof of Utilization-Bound Test for EDF Proof. Because J i,k missed its deadline, we know that d i,k t 1 < demand in [t 1, d i,k ) by jobs with absolute deadline no more than d i,k n di,k t 1 = C j j=1 n j=1 T j d i,k t 1 C j T j By cancelling d i,k t 1, we conclude the proof by 1 < n j=1 C j T j = U. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 10 / 38
12 Relative Deadlines Less than Periods Theorem A task set T of n independent, preemptable, periodic tasks with constrained deadlines can be feasibly scheduled (under EDF) on one processor if n C k min{d k, T k } 1. k=1 This theorem only gives a sufficient schedulability test. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 11 / 38
13 Outline Schedulability for Dynamic-Priority Scheduling Schedulability for Static-Priority (or Fixed-Priority) Scheduling Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 12 / 38
14 Static-Priority (or Fixed-Priority) Scheduling Different jobs of a task are assigned the same priority. Note: we will assume that no two tasks have the same priority. We will implicitly index tasks in decreasing priority order, i.e., τ i has higher priority than τ k if i < k. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 38
15 Static-Priority (or Fixed-Priority) Scheduling Different jobs of a task are assigned the same priority. Note: we will assume that no two tasks have the same priority. We will implicitly index tasks in decreasing priority order, i.e., τ i has higher priority than τ k if i < k. Which strategy is better or the best? largest execution time first? shortest job first? least-utilization first? most importance first? least period first? Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 38
16 Rate-Monotonic (RM) Scheduling (Liu and Layland, 1973) Priority Definition: A task with a smaller period has higher priority, in which ties are broken arbitrarily. Example Schedule: τ 1 = (1, 6, 6), τ 2 = (2, 8, 8), τ 3 = (4, 12, 12). [(C i, T i, D i )] τ 1 τ 1 τ 1 τ 1 τ τ 2 τ 2 τ 2 τ τ 3 τ 3 τ 3 τ 3 τ Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 14 / 38
17 Deadline-Monotonic (DM) Scheduling (Leung and Whitehead) Priority Definition: A task with a smaller relative deadline has higher priority, in which ties are broken arbitrarily. Example Schedule: τ 1 = (2, 8, 4), τ 2 = (1, 6, 6), τ 3 = (4, 12, 12). [(C i, T i, D i )] τ 1 τ 1 τ 1 τ τ 2 τ 2 τ 2 τ 2 τ τ 3 τ 3 τ 3 τ 3 τ Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 15 / 38
18 Optimality (or not) of RM and DM Example Schedule: τ 1 = (2, 4, 4), τ 2 = (5, 10, 10) τ 1 τ 1 τ 1 τ 1 τ 1 τ τ 2 τ 2 τ 2 τ 2 τ The above system is schedulable. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 16 / 38
19 Optimality (or not) of RM and DM Example Schedule: τ 1 = (2, 4, 4), τ 2 = (5, 10, 10) τ 1 τ 1 τ 1 τ 1 τ 1 τ τ 2 τ 2 τ 2 τ 2 τ The above system is schedulable. No static-priority scheme is optimal for scheduling periodic tasks: However, a deadline will be missed, regardless of how we choose to (statically) prioritize τ 1 and τ 2. Corollary Neither RM nor DM is optimal. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 16 / 38
20 τ 4 t Properties of Worst-Case Response Time Suppose that we are analyzing the worst-case response time of task τ i. Let us assume that the n 1 tasks are already verified to meet their deadlines. τ 1 τ 2 τ 3 Suppose t is the arrival time of a job of task τ i. A higher priority task τ j may release a job before t and this job is executed after t. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 17 / 38
21 Properties of Worst-Case Response Time (cont.) Let t j be the arrival time of the first job of task τ j after or at time t. t j t. The remaining execution time of the job of task τ j arrived before t and unfinished at time t is at most C j. Since fixed-priority scheduling greedily executes an available job, the system remains busy from t till the time instant f at which task τ n finishes the job arrived at time t. That is, i 1 i 1 { t t tj < t < f, C i + C j + max j=1 As a result, (t t is replaced by t) j=1 i 1 i 1 t 0 < t < f t tj, C i + C j + j=1 j=1 T j T j } C j, 0 > t. C j > t. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 18 / 38
22 Properties of Worst-Case Response Time (cont.) The minimum t such that i 1 i 1 t tj 0 < t T i, C i + C j + j=1 j=1 T j C j = t. is a safe upper bound on the worst-case response time of task τ i. Why do we need to constrain t T i? Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 19 / 38
23 Aside: Critical Instants Definition The critical instant of a task τ i is a time instant such that: 1 the job of τ i released at this instant has the maximum response time of all jobs in τ i, if the response time of every job of τ i is at most T i, the period of τ i, and 2 the response time of the job released at this instant is greater than T i if the response time of some job in τ i exceeds T i. Informally, a critical instant of τ i represents a worst-case scenario from τ i s standpoint when we use static-priority scheduling. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 20 / 38
24 Critical Instants in Static-Priority Systems Theorem [Liu and Layland, JACM 1973] The critical instance of task τ i for a set of independent, preemptable periodic tasks with implicit deadlines is to release the first jobs of all the higher-priority tasks at the same time. We are not saying that τ 1,..., τ i will all necessarily release their first jobs at the same time, but if this does happen, we are claiming that the time of release will be a critical instant for task τ i. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 21 / 38
25 Critical Instants: Informal Proof τ 1 τ 2 τ 3 τ 4 t 1 t t R Shifting the release time of tasks together will increase the response time of task τ i. Consider a job of τ i, released at time t, with completion time t R. Let t 1 be the latest idle instant for τ 1,..., τ i 1 at or before t R. Let J be τ i s job released at t. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 22 / 38
26 Critical Instants: Informal Proof τ 1 τ 2 τ 3 τ 4 t 1 t t R We will show that shifting the release time of tasks together will increase the response time of task τ i. Moving J from t to t 1 does not decrease the completion time of J. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 23 / 38
27 Critical Instants: Informal Proof τ 1 τ 2 τ 3 τ 4 t 1 t t R We will show that shifting the release time of tasks together will increase the response time of task τ i. Releasing τ 1 at t 1 does not decrease the completion time of J. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 24 / 38
28 Critical Instants: Informal Proof τ 1 τ 2 τ 3 τ 4 t 1 t t R We will show that shifting the release time of tasks together will increase the response time of task τ i. Releasing τ 2 at t 1 does not decrease the completion time of J. Repeating the above movement and proves the criticality of the critical instant Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 25 / 38
29 Necessary and Sufficient (Exact) RM-Schedulability Time-demand analysis (TDA) TDA can be applied to produce a schedulability test for any fixed-priority algorithm that ensures that each job of every task completes before the next job of that task is released. For some important task models and scheduling algorithms, this schedulability test will be necessary and sufficient. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 26 / 38
30 Schedulability Condition According to the critical instant theorem, to test the schedulability of task τ i, we have to 1 release all the higher-priority tasks at time 0 together with task τ i 2 release all the higher-priority task instances as early as they can We can simply simulate the above behavior to verify whether task τ i misses the deadline. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 27 / 38
31 Schedulability Test The time-demand function W i (t) of the task τ i is defined as follows: i 1 t W i (t) = C i + C j. Theorem A system T of periodic, independent, preemptable tasks is schedulable on one processor by algorithm A if j=1 T j τ i T t with 0 < t D i and W i (t) t holds. This condition is also necessary for synchronous, periodic task systems and also sporadic task sets. Note that this holds for implicit-deadline and constrained-deadline task sets. The sufficient condition can be proved by contradiction. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 28 / 38
32 How to Use TDA? The theorem of TDA might look strong as it requires to check all the time t with 0 < t D i for a given τ i. There are two ways to avoid this: Iterate using t(k + 1) := W i (t(k)), starting with t(0) := i j=1 C j, and stopping when, for some l, t(l) = W i (t(l)) or t(l) > D i. Only consider t {lt j ɛ 1 j i, l N + }, where ɛ is a constant close to 0. That is, only consider t at which a job of higher-priority tasks arrives. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 29 / 38
33 Optimality Among Static-Priority Algorithms Theorem A system T of n independent, preemptable, synchronous periodic tasks with implicit deadlines can be feasibly scheduled on one processor according to the RM algorithm whenever it can be feasibly scheduled according to any static priority algorithm. The proof is omitted. It can be proved by using the critical instant theorem and the TDA analysis. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 30 / 38
34 Harmonic Real-Time Systems Definition A system of periodic tasks is said with harmonic periods (also: simply periodic) if for every pair of tasks τ i and τ k in the system where T i < T k, T k is an integer multiple of T i. For example: Periods are 2, 6, 12, 24. Theorem [Kuo and Mok]: A system T of harmonic, independent, preemptable, and implicit-deadline tasks is schedulable on one processor according to the RM algorithm if and only if its total utilization U(T ) = τ j T C j T j is less than or equal to 1. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 31 / 38
35 Proof for Harmonic Systems The case for the only-if part is skipped. τ 1 τ 2 τ 3 By using the contrapositive proof approach, suppose that T is not schedulable and τ i misses its deadline. We will prove that the utilization must be larger than 1. The response time of τ i is larger than D i. By critical instants, releasing all the tasks τ 1, τ 2,..., τ i at time 0 will lead to a response time of τ i larger than D i. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 32 / 38
36 Proof for Harmonic Systems (cont.) As the schedule is workload-conserving, we know that from time 0 to time D i, the whole system is executing jobs. Therefore, D i < the workload released in time interval [0, D i ) i = C j ( the number of job releases of τ j in time interval [0, D i )) = j=1 i C j j=1 Di T j i = C j Di, T j j=1 where = is because D i = T i is an integer multiple of T j when j i. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 33 / 38
37 Proof for Harmonic Systems (cont.) As the schedule is workload-conserving, we know that from time 0 to time D i, the whole system is executing jobs. Therefore, D i < the workload released in time interval [0, D i ) i = C j ( the number of job releases of τ j in time interval [0, D i )) = j=1 i C j j=1 Di T j i = C j Di, T j j=1 where = is because D i = T i is an integer multiple of T j when j i. By canceling D i, we reach the contradiction by having i C j 1 < C j. T j T j τ j T j=1 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 33 / 38
38 Utilization-Based Schedulability Test Task utilization: U i := C i. T i System (total) utilization: U(T ) := τ i T C i T i. A task system T fully utilizes the processor under scheduling algorithm A if any increase in execution time (of any task) causes A to miss a deadline. In this case, U(T ) is an upper bound on utilization for A, denoted U ub (T, A). U lub (A) is the least upper bound for algorithm A: U lub (A) = min T U ub(t, A) Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 34 / 38
39 What is U lub (A) for? T 1 U ub (T 1, A) T 2 U ub (T 2, A) T 3 U ub (T 3, A) T 4 U ub (T 4, A) T 5 U ub (T 5, A)... T? U ub (T?, A) 0 U lub (A) 1 Feasible Unsure Infeasible Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 35 / 38
40 Liu and Layland Bound Theorem [Liu and Layland] A set of n independent, preemptable periodic tasks with implicit deadlines can be scheduled on a processor according to the RM algorithm if its total utilization U is at most n(2 1 n 1). In other words, U lub (RM, n) = n(2 1 n 1) n U lub (RM, n) n U lub (RM, n) = ln2 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 36 / 38
41 Least Upper Bound Least Upper Bound RM Bound n Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 37 / 38
42 Comparison between RM and EDF (Implicit Deadlines) RM Low run-time overhead:o(1) with priority sorting in advance Optimal for static-priority Schedulability test is N P-hard (even if the relative deadline = period) Least upper bound: In general, more preemption EDF High run-time overhead:o(log n) with balanced binary tree Optimal for dynamic-priority Schedulability test is easy (when the relative deadline = period) Least upper bound: 1 In general, less preemption Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 38 / 38
Schedulability 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 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 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 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 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 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 informationScheduling Algorithms for Multiprogramming in a Hard Realtime Environment
Scheduling Algorithms for Multiprogramming in a Hard Realtime Environment C. Liu and J. Layland Journal of the ACM, 20(1):46--61, January 1973. 2 Contents 1. Introduction and Background 2. The Environment
More informationReal-Time Systems. LS 12, TU Dortmund
Real-Time Systems Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund April 24, 2014 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 57 Organization Instructor: Jian-Jia Chen, jian-jia.chen@cs.uni-dortmund.de
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 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 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 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 informationReal-time Systems: Scheduling Periodic Tasks
Real-time Systems: Scheduling Periodic Tasks Advanced Operating Systems Lecture 15 This work is licensed under the Creative Commons Attribution-NoDerivatives 4.0 International License. To view a copy of
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 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 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 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 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 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 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 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 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 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 informationReal-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3
Real-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3 Lecture Outline The rate monotonic algorithm (cont d) Maximum utilisation test The deadline monotonic algorithm The earliest
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 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 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 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 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 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 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 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 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 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 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 informationPriority-driven Scheduling of Periodic Tasks (1) Advanced Operating Systems (M) Lecture 4
Priority-driven Scheduling of Periodic Tasks (1) Advanced Operating Systems (M) Lecture 4 Priority-driven Scheduling Assign priorities to jobs, based on their deadline or other timing constraint Make scheduling
More information2.1 Task and Scheduling Model. 2.2 Definitions and Schedulability Guarantees
Fixed-Priority Scheduling of Mixed Soft and Hard Real-Time Tasks on Multiprocessors Jian-Jia Chen, Wen-Hung Huang Zheng Dong, Cong Liu TU Dortmund University, Germany The University of Texas at Dallas,
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 informationReal-Time Scheduling. Real Time Operating Systems and Middleware. Luca Abeni
Real Time Operating Systems and Middleware Luca Abeni luca.abeni@unitn.it Definitions Algorithm logical procedure used to solve a problem Program formal description of an algorithm, using a programming
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 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 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 informationThere are three priority driven approaches that we will look at
Priority Driven Approaches There are three priority driven approaches that we will look at Earliest-Deadline-First (EDF) Least-Slack-Time-first (LST) Latest-Release-Time-first (LRT) 1 EDF Earliest deadline
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 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 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 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 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 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 informationRate-monotonic scheduling on uniform multiprocessors
Rate-monotonic scheduling on uniform multiprocessors Sanjoy K. Baruah The University of North Carolina at Chapel Hill Email: baruah@cs.unc.edu Joël Goossens Université Libre de Bruxelles Email: joel.goossens@ulb.ac.be
More informationBursty-Interference Analysis Techniques for. Analyzing Complex Real-Time Task Models
Bursty-Interference Analysis Techniques for lemma 3 Analyzing Complex Real- Task Models Cong Liu Department of Computer Science The University of Texas at Dallas Abstract Due to the recent trend towards
More informationMultiprocessor Real-Time Scheduling Considering Concurrency and Urgency
Multiprocessor Real-Time Scheduling Considering Concurrency Urgency Jinkyu Lee, Arvind Easwaran, Insik Shin Insup Lee Dept. of Computer Science, KAIST, South Korea IPP-HURRAY! Research Group, Polytechnic
More informationTardiness Bounds under Global EDF Scheduling on a Multiprocessor
Tardiness ounds under Global EDF Scheduling on a Multiprocessor UmaMaheswari C. Devi and James H. Anderson Department of Computer Science The University of North Carolina at Chapel Hill Abstract This paper
More informationLecture: 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 informationReal-Time Scheduling
1 Real-Time Scheduling Formal Model [Some parts of this lecture are based on a real-time systems course of Colin Perkins http://csperkins.org/teaching/rtes/index.html] Real-Time Scheduling Formal Model
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 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 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 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 informationCIS 4930/6930: Principles of Cyber-Physical Systems
CIS 4930/6930: Principles of Cyber-Physical Systems Chapter 11 Scheduling Hao Zheng Department of Computer Science and Engineering University of South Florida H. Zheng (CSE USF) CIS 4930/6930: Principles
More informationDeadline-driven scheduling
Deadline-driven 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 informationDependency Graph Approach for Multiprocessor Real-Time Synchronization. TU Dortmund, Germany
Dependency Graph Approach for Multiprocessor Real-Time Synchronization Jian-Jia Chen, Georg von der Bru ggen, Junjie Shi, and Niklas Ueter TU Dortmund, Germany 14,12,2018 at RTSS Jian-Jia Chen 1 / 21 Multiprocessor
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 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 informationSemi-Partitioned Fixed-Priority Scheduling on Multiprocessors
Semi-Partitioned Fixed-Priority Scheduling on Multiprocessors Shinpei Kato and Nobuyuki Yamasaki Department of Information and Computer Science Keio University, Yokohama, Japan {shinpei,yamasaki}@ny.ics.keio.ac.jp
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 informationDynamic-Priority Scheduling. CSCE 990: Real-Time Systems. Steve Goddard. Dynamic-priority Scheduling
CSCE 990: Real-Time Systems Dynamic-Priority Scheduling Steve Goddard goddard@cse.unl.edu htt://www.cse.unl.edu/~goddard/courses/realtimesystems Dynamic-riority Scheduling Real-Time Systems Dynamic-Priority
More informationPASS: Priority Assignment of Real-Time Tasks with Dynamic Suspending Behavior under Fixed-Priority Scheduling
T E C H N I C A L R E P O RT S I N C O M P U T E R S C I E N C E Technische Universität Dortmund PASS: Priority Assignment of Real-Time Tasks with Dynamic Suspending Behavior under Fixed-Priority Scheduling
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 informationTardiness Bounds under Global EDF Scheduling on a. Multiprocessor
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor UmaMaheswari C. Devi and James H. Anderson Department of Computer Science The University of North Carolina at Chapel Hill Abstract We consider
More informationOnline Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems
Online Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems Song Han 1 Deji Chen 2 Ming Xiong 3 Aloysius K. Mok 1 1 The University of Texas at Austin 2 Emerson Process Management
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 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 informationMixed Criticality in Safety-Critical Systems. LS 12, TU Dortmund
Mixed Criticality in Safety-Critical Systems Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 18, July, 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 25 Motivation today s embedded systems use complex
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 informationDESH: overhead reduction algorithms for deferrable scheduling
DOI 10.1007/s11241-009-9087-4 DESH: overhead reduction algorithms for deferrable scheduling Ming Xiong Song Han Deji Chen Kam-Yiu Lam Shan Feng Springer Science+Business Media, LLC 2009 Abstract Although
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 informationAn Improved Schedulability Test for Uniprocessor. Periodic Task Systems
An Improved Schedulability Test for Uniprocessor Periodic Task Systems UmaMaheswari C. Devi Department of Computer Science, University of North Carolina, Chapel Hill, NC 27599-375 December 2002 Abstract
More informationReal-Time Workload Models with Efficient Analysis
Real-Time Workload Models with Efficient Analysis Advanced Course, 3 Lectures, September 2014 Martin Stigge Uppsala University, Sweden Fahrplan 1 DRT Tasks in the Model Hierarchy Liu and Layland and Sporadic
More informationEDF and RM Multiprocessor Scheduling Algorithms: Survey and Performance Evaluation
1 EDF and RM Multiprocessor Scheduling Algorithms: Survey and Performance Evaluation Omar U. Pereira Zapata, Pedro Mejía Alvarez CINVESTAV-IPN, Sección de Computación Av. I.P.N. 258, Zacatenco, México,
More informationOn the Soft Real-Time Optimality of Global EDF on Multiprocessors: From Identical to Uniform Heterogeneous
On the Soft Real-Time Optimality of Global EDF on Multiprocessors: From Identical to Uniform Heterogeneous Kecheng Yang and James H. Anderson Department of Computer Science, University of North Carolina
More informationBounding the End-to-End Response Times of Tasks in a Distributed. Real-Time System Using the Direct Synchronization Protocol.
Bounding the End-to-End Response imes of asks in a Distributed Real-ime System Using the Direct Synchronization Protocol Jun Sun Jane Liu Abstract In a distributed real-time system, a task may consist
More informationOn-line scheduling of periodic tasks in RT OS
On-line scheduling of periodic tasks in RT OS Even if RT OS is used, it is needed to set up the task priority. The scheduling problem is solved on two levels: fixed priority assignment by RMS dynamic scheduling
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 informationControlling Preemption for Better Schedulability in Multi-Core Systems
2012 IEEE 33rd Real-Time Systems Symposium Controlling Preemption for Better Schedulability in Multi-Core Systems Jinkyu Lee and Kang G. Shin Dept. of Electrical Engineering and Computer Science, The University
More informationUniprocessor real-time scheduling
Uniprocessor real-time scheduling Julien Forget Université Lille 1 Ecole d Été Temps Réel - 30 Août 2017 Julien Forget (Université Lille 1) Uniprocessor real-time scheduling ETR 2017 1 / 67 Overview At
More informationOn Non-Preemptive Scheduling of Periodic and Sporadic Tasks
On Non-Preemptive Scheduling of Periodic and Sporadic Tasks Kevin Jeffay * Donald F. Stanat University of North Carolina at Chapel Hill Department of Computer Science Charles U. Martel ** University of
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 informationLaxity dynamics and LLF schedulability analysis on multiprocessor platforms
DOI 10.1007/s11241-012-9157-x Laxity dynamics and LLF schedulability analysis on multiprocessor platforms Jinkyu Lee Arvind Easwaran Insik Shin Springer Science+Business Media, LLC 2012 Abstract LLF Least
More informationExam Spring Embedded Systems. Prof. L. Thiele
Exam Spring 20 Embedded Systems Prof. L. Thiele NOTE: The given solution is only a proposal. For correctness, completeness, or understandability no responsibility is taken. Sommer 20 Eingebettete Systeme
More informationPredictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems
Predictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems Sangchul Han and Minkyu Park School of Computer Science and Engineering, Seoul National University, Seoul,
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 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 informationNon-Work-Conserving Scheduling of Non-Preemptive Hard Real-Time Tasks Based on Fixed Priorities
Non-Work-Conserving Scheduling of Non-Preemptive Hard Real-Time Tasks Based on Fixed Priorities Mitra Nasri, Gerhard Fohler Chair of Real-time Systems, Technische Universität Kaiserslautern, Germany {nasri,
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 informationarxiv: v1 [cs.os] 25 May 2011
Scheduling of Hard Real-Time Multi-Thread Periodic Tasks arxiv:1105.5080v1 [cs.os] 25 May 2011 Irina Lupu Joël Goossens PARTS Research Center Université libre de Bruxelles (U.L.B.) CP 212, 50 av. F.D.
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 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 informationSupplement of Improvement of Real-Time Multi-Core Schedulability with Forced Non- Preemption
12 Supplement of Improvement of Real-Time Multi-Core Schedulability with Forced Non- Preemption Jinkyu Lee, Department of Computer Science and Engineering, Sungkyunkwan University, South Korea. Kang G.
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 information