Multiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund
|
|
- Priscilla Murphy
- 5 years ago
- Views:
Transcription
1 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
2 Outline Introduction to Multiprocessor Scheduling Partitioned Scheduling for Implicit-Deadline EDF Scheduling Partitioned Scheduling for Implicit-Deadline RM Scheduling Partitioned Scheduling for Constrained-Deadline DM Scheduling Partitioned Scheduling for Arbitrary-Deadline EDF Scheduling Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 2 / 47
3 Multiprocessor Models Identical (Homogeneous): All the processors have the same characteristics, i.e., the execution time of a job is independent on the processor it is executed. Uniform: Each processor has its own speed, i.e., the execution time of a job on a processor is proportional to the speed of the processor. A faster processor always executes a job faster than slow processors do. For example, multiprocessors with the same instruction set but with different supply voltages/frequencies. Unrelated (Heterogeneous): Each job has its own execution time on a specified processor A job might be executed faster on a processor, but other jobs might be slower on that processor. For example, multiprocessors with different instruction sets. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 3 / 47
4 Scheduling Models Partitioned Scheduling: Each task is assigned on a dedicated processor. Schedulability is done individually on each processor. It requires no additional on-line overhead. Global Scheduling: A job may execute on any processor. The system maintains a global ready queue. Execute the M highest-priority jobs in the ready queue, where M is the number of processors. It requires high on-line overhead. Semi-Partitioned Scheduling: Adopt task partitioning first and reserve time slots (bandwidths) for tasks that allow migration. It requires some on-line overhead. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 4 / 47
5 Course Material Ronald L. Graham: Bounds for certain multiprocessing anomalies. in Bell System Technical Journal (1966). Ronald L. Graham: Bounds on Multiprocessing Timing Anomalies. SIAM Journal of Applied Mathematics 17(2): (1969) Dorit S. Hochbaum, David B. Shmoys: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1): (1987) (in textbook Approximation Algorithms by Vijay Vazirani, Chapter 10, not covered) Sanjoy K. Baruah, Nathan Fisher: The Partitioned Multiprocessor Scheduling of Sporadic Task Systems. RTSS 2005: Jian-Jia Chen: Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks. CoRR abs/ (2015) Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 5 / 47
6 Terminologies Used in Scheduling Theory Graham s Scheduling Algorithm Classification Classification: a b c a: machine environment (e.g., uniprocessor, multiprocessor, distributed,...) b: task and resource characteristics (e.g., preemptive, independent, synchronous,...) c: performance metric and objectives (e.g., L max, sum of finish times,...) Makespan problem: M C max The course material mainly comes from the traditional makespan scheduling in the context of minimizing the maximum utilization. (The paper by Baruah and Fisher in RTSS 2005 is an exception.) Imagine that the goal is to minimize the maximum utilization after task partitioning. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 6 / 47
7 Bin Packing Problem Given a bin size b, and a set of items with individual sizes, the objective is to assign each item to a bin without violating the bin size constraint such that the number of allocated bins is minimized. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 7 / 47
8 Outline Introduction to Multiprocessor Scheduling Partitioned Scheduling for Implicit-Deadline EDF Scheduling Partitioned Scheduling for Implicit-Deadline RM Scheduling Partitioned Scheduling for Constrained-Deadline DM Scheduling Partitioned Scheduling for Arbitrary-Deadline EDF Scheduling Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 8 / 47
9 Problem Definition Partitioned Scheduling Given a set T of tasks with implicit deadlines, i.e., τ i T, = D i, the objective is to decide a feasible task assignment onto M processors such that all the tasks meet their timing constraints, where C im is the execution time of task τ i on processor m. For identical multiprocessors: C i = C i1 = C i2 = = C im. For uniform multiprocessors: each processor m has a speed s m, in which C im s m is a constant. For unrelated multiprocessors: C im is an independent variable. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 9 / 47
10 Hardness and Approximation of Partitioned Scheduling N P-complete Deciding whether there exists a feasible task assignment is N P-complete in the strong sense. Proof Reduced from the makespan or the bin packing problem. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 10 / 47
11 Hardness and Approximation of Partitioned Scheduling N P-complete Deciding whether there exists a feasible task assignment is N P-complete in the strong sense. Proof Reduced from the makespan or the bin packing problem. Approximations are possible, but what do we approximate when only binary decisions (Yes or No) have to be made? Deadline relaxation: requires modifications of task specification Period relaxation: requires modifications of task specification Resource augmentation by speeding up: requires a faster platform Resource augmentation by allocating more processors: requires a better platform Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 10 / 47
12 Approximation Algorithms An algorithm A is called an η-approximation algorithm (for a minimization problem) if it guarantees to derive a feasible solution for any input instance I with at most η times of the objective function of an optimal solution. That is, A(I ) ηopt (I ), where OPT (I ) is the objective function of an optimal solution. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 11 / 47
13 Largest-Utilization-First (LUF) - for EDF Scheduling Input: T, M; 1: re-index (sort) tasks such that C i C j T j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 4: find m with the minimum utilization, i.e., U m = min m M U m ; 5: if U m + C i > 1 then 6: return The task assignment fails ; 7: else 8: assign task τ i onto processor m, where U m U m + C i, {τ i }; 9: return feasible task assignment T 1, T 2,..., T M ; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 12 / 47
14 Largest-Utilization-First (LUF) - for EDF Scheduling Input: T, M; 1: re-index (sort) tasks such that C i C j T j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 4: find m with the minimum utilization, i.e., U m = min m M U m ; 5: if U m + C i > 1 then 6: return The task assignment fails ; 7: else 8: assign task τ i onto processor m, where U m U m + C i, {τ i }; 9: return feasible task assignment T 1, T 2,..., T M ; Properties The time complexity is O((N + M) log(n + M)) If a solution is derived, the task assignment is feasible by using EDF. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 12 / 47
15 Algorithm LUF τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
16 Algorithm LUF (0, 0, 0) τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
17 Algorithm LUF (.5, 0, 0) τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ τ 1 P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
18 Algorithm LUF (.5,.45, 0) τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ τ 1 τ 2 P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
19 Algorithm LUF (.5,.45,.37) τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ τ 1 τ 2 τ 3 P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
20 Algorithm LUF (.5,.45,.67) τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ τ 4 τ 1 τ 2 τ 3 P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
21 Algorithm LUF (.5,.65,.67) τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ τ 5 τ 4 τ 1 τ 2 τ 3 P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
22 Algorithm LUF (.7,.65,.67) τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ τ 6 τ 5 τ 4 τ 1 τ 2 τ 3 P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
23 Algorithm LUF (.7,.8,.67) τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ τ 6 τ 7 τ 5 τ 4 τ 1 τ 2 τ 3 P 1 P 2 P 3 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
24 Algorithm LUF τ 1 τ 2 τ 3 τ 4 τ 5 τ 6 τ 7 τ τ 6 τ 7 τ 5 τ 8 τ 4 τ 1 τ 2 τ 3 P 1 U = 0.7 P 2 U = 0.8 P 3 U = 0.77 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 47
25 Optimality of Algorithm LUF Theorem If an optimal assignment for minimizing the maximal utilization results in at most two tasks on any processor, LUF is optimal. Proof The proof is omitted. If you are interested, you can take the proof as an exercise. The proof can be found from Graham s paper. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 14 / 47
26 What Happens if Algorithm LUF Fails? Assume that there exists a feasible task partition on M processors (for providing the analysis of resource augmentation). Suppose that Algorithm LUF fails when assigning task τ j and U m for m = 1, 2,..., M is the utilization of processor m before assigning τ j. Let U opt be the utilization of the optimal assignment for minimizing the maximal utilization for tasks {τ 1, τ 2,..., τ j }. By definition, 1 U opt j C i / i=1. M C j T j 1 Uopt: otherwise, there will be at most two tasks on any processors 3 in the optimal solution. this contradicts the assumption that Algorithm LUF fails as it is optimal. Since U m U m, we know that U m M U m m=1 M = j 1 C i / i=1. M Therefore, C j T j + U m C j T j (1 1 M ) + j i=1 C i / M ( ) ( 4 U opt 3M 3 1 ). 3M Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 15 / 47
27 Algorithm LUF : Resource Augmentation Input: T, M; 1: re-index (sort) tasks such that C i C j T j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 4: find the processor m with the minimum task utilization, i.e., U m = min m U m ; 5: assign task τ i onto processor m, where U i U i + C i, {τ i }; 6: return task assignment T 1, T 2,..., T M with a speedup factor max{1, U m }; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 16 / 47
28 Properties of LUF Theorem If the input task set can be feasibly scheduled, Algorithm LUF derives a feasible task assignment/schedule by running the processors at a speedup factor by at most M. Theorem If the input task set cannot be feasibly scheduled by Algorithm LUF, the task set is not schedulable by running at a slow-down factor M. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 17 / 47
29 Algorithm LUF + : Resource Augmentation on Processors Input: T; 1: re-index (sort) tasks such that C i 2: T 1, U 1 0, ˆM 1; 3: for i = 1 to N, where N = T do C j T j for i < j; 4: find a processor m with U m + C i 1; 5: if no such a processor exists then 6: ˆM ˆM + 1, T ˆM, U ˆM 0; 7: m ˆM; 8: assign task τ i onto processor m, where U i U i + C i, {τ i }; 9: return task assignment T 1, T 2,..., T ˆM; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 18 / 47
30 Algorithm LUF + : Resource Augmentation on Processors Input: T; 1: re-index (sort) tasks such that C i 2: T 1, U 1 0, ˆM 1; 3: for i = 1 to N, where N = T do C j T j for i < j; 4: find a processor m with U m + C i 1; 5: if no such a processor exists then 6: ˆM ˆM + 1, T ˆM, U ˆM 0; 7: m ˆM; 8: assign task τ i onto processor m, where U i U i + C i, {τ i }; 9: return task assignment T 1, T 2,..., T ˆM; Properties The time complexity is O(N log N) or O(N 2 ), depending on the fitting approaches. The resulting solution is feasible on ˆM processors. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 18 / 47
31 Different Fitting Approaches 4: find a processor m with U m + C i 1; Fitting Strategies First-Fit: choose the feasible one with the smallest index Last-Fit: choose the feasible one with the largest index Best-Fit: choose the feasible one with the maximal utilization Worst-Fit: choose the feasible one with the minimal utilization Suppose that we want to assign a task with utilization equal to P 1 P 2 P 3 P 4 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 19 / 47
32 Different Fitting Approaches 4: find a processor m with U m + C i 1; Fitting Strategies First-Fit: choose the feasible one with the smallest index Last-Fit: choose the feasible one with the largest index Best-Fit: choose the feasible one with the maximal utilization Worst-Fit: choose the feasible one with the minimal utilization Suppose that we want to assign a task with utilization equal to 0.1. First 0.6Fit P 1 P 2 P 3 P 4 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 19 / 47
33 Different Fitting Approaches 4: find a processor m with U m + C i 1; Fitting Strategies First-Fit: choose the feasible one with the smallest index Last-Fit: choose the feasible one with the largest index Best-Fit: choose the feasible one with the maximal utilization Worst-Fit: choose the feasible one with the minimal utilization Suppose that we want to assign a task with utilization equal to 0.1. First 0.6Fit Last 0.65Fit P 1 P 2 P 3 P 4 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 19 / 47
34 Different Fitting Approaches 4: find a processor m with U m + C i 1; Fitting Strategies First-Fit: choose the feasible one with the smallest index Last-Fit: choose the feasible one with the largest index Best-Fit: choose the feasible one with the maximal utilization Worst-Fit: choose the feasible one with the minimal utilization Suppose that we want to assign a task with utilization equal to 0.1. First 0.6Fit Best 0.7Fit 0.5 Last 0.65Fit P 1 P 2 P 3 P 4 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 19 / 47
35 Different Fitting Approaches 4: find a processor m with U m + C i 1; Fitting Strategies First-Fit: choose the feasible one with the smallest index Last-Fit: choose the feasible one with the largest index Best-Fit: choose the feasible one with the maximal utilization Worst-Fit: choose the feasible one with the minimal utilization Suppose that we want to assign a task with utilization equal to 0.1. First 0.6Fit Best 0.7Fit Worst 0.5Fit Last 0.65Fit P 1 P 2 P 3 P 4 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 19 / 47
36 Algorithm LUF + : How Many Processors? Suppose that the processor used by Algorithm LUF + is ˆM 2. Let m be the processor with the minimum utilization. By the fitting algorithm, we know that U m + U m > 1 and U m U m all the other processors ms. If U m 0.5, by U m > 1 U m, we know that for τ i T C i U m + ˆM m=1,m m U m ˆM 1 ( ˆM 2)U m = ( ˆM 2)(1 U m )+1 If U m > 0.5, by U m U m, we know that Theorem τ i T C i U m + ˆM m=1,m m U m Algorithm LUF + is a 2-approximation algorithm. ˆM 2. ˆM 2. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 20 / 47
37 Algorithm LUF Revisit: Upper and Lower Bounds Let m be the processor with the maximum utilization among M processors. Let τ k be the last task that is added to m. Therefore, we know that U m U m C k T k for any other processor m. The lower bound of the maximum utilization to map T on M processor is LB max U m { C i max, τ i T τ i T M C i } U m + C M k m=1 U m + C k = T k M T k C i τ i T M Therefore, we reach that { } C C i i τ max max, i T = LB U m 2LB. τ i T M + C k T k 2LB. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 21 / 47
38 Outline Introduction to Multiprocessor Scheduling Partitioned Scheduling for Implicit-Deadline EDF Scheduling Partitioned Scheduling for Implicit-Deadline RM Scheduling Partitioned Scheduling for Constrained-Deadline DM Scheduling Partitioned Scheduling for Arbitrary-Deadline EDF Scheduling Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 22 / 47
39 Largest-Utilization-First (LUF + ) - for RM Scheduling Input: T; 1: re-index (sort) tasks such that C i 2: T 1, U 1 0, n 1 0; ˆM 1; 3: for i = 1 to N, where N = T do C j T j for i < j; 4: find a processor m with U m + C i (n m + 1) 5: if no such a processor exists then 6: ˆM ˆM + 1, T ˆM, U ˆM 0, n ˆM 0; 7: m ˆM; 8: assign task τ i onto processor m, where U i U i + C i, {τ i }, n m n m + 1; 9: return task assignment T 1, T 2,..., T ˆM; ) (2 1 n m +1 1 ; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 23 / 47
40 Largest-Utilization-First (LUF + ) - for RM Scheduling Input: T; 1: re-index (sort) tasks such that C i 2: T 1, U 1 0, n 1 0; ˆM 1; 3: for i = 1 to N, where N = T do C j T j for i < j; 4: find a processor m with U m + C i (n m + 1) 5: if no such a processor exists then 6: ˆM ˆM + 1, T ˆM, U ˆM 0, n ˆM 0; 7: m ˆM; 8: assign task τ i onto processor m, where U i U i + C i, {τ i }, n m n m + 1; 9: return task assignment T 1, T 2,..., T ˆM; Properties The time complexity is O((N + M) log(n + M)) ) (2 1 n m +1 1 ; If a solution is derived, the task assignment is feasible by using RM. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 23 / 47
41 A Simple Analysis ( ) The schedulability test U m + C i (n m + 1) 2 1 n m +1 1 is upper bounded by 69.3%. According to the above analysis for EDF, we can also conclude that the utilization is at least ˆM 2. Therefore, the approximation factor of LUF + is Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 24 / 47
42 A More Precise Analysis If ˆM is 1, we know that τ i T C i N(2 1 N 1). Suppose that the processor used by Algorithm LUF + is ˆM 2. Let k be the index of the task, at which processor ˆM is allocated when running LUF +. We only look at the iteration when i is k. Therefore, U k + ) U i > (n m + 1) (2 nm+1 1 1, m = 1,..., ˆM 1. τ i T m By the sorting of the tasks, we also know that U i U k for any i k. This also implies that ( ) τ i T m U i > n m 2 nm ) x (2 x is an increasing function of x when x 1. Let q be the minimum number of tasks assigned on a processor before task τ k, i.e., 1 q n m, m = 1,..., ˆM 1. The approximation factor is since k 1 U k + U i > (1 + ( ˆM ) 1)q) (2 q ˆM( 2 1) ˆM. i=1 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 25 / 47
43 Remarks (Augmenting the Number of Processors) Survey by Davis and Burns (ACM Computing Surveys, 2011): Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 26 / 47
44 Outline Introduction to Multiprocessor Scheduling Partitioned Scheduling for Implicit-Deadline EDF Scheduling Partitioned Scheduling for Implicit-Deadline RM Scheduling Partitioned Scheduling for Constrained-Deadline DM Scheduling Partitioned Scheduling for Arbitrary-Deadline EDF Scheduling Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 27 / 47
45 Definition and Theorem Recalled For a task set, we say that the task set is with constrained deadline when the relative deadline D i is no more than the period, i.e., D i, for every task τ i, or arbitrary deadline when the relative deadline D i could be larger than the period for some task τ i. Theorem A task set T of independent, preemptable, periodic tasks can be feasibly scheduled (under EDF) on one processor if and only if t 0, n i=1 { max 0, t + Ti D i } C i t. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 28 / 47
46 Problem Definition Partitioned Scheduling Given a set T of tasks with arbitrary deadlines, the objective is to decide a feasible task assignment onto M processors such that all the tasks meet their timing constraints, where C i is the execution time of task τ i on any processor m. I will only focus on speed-up (resource augmentation) factors for the rest of the slides. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 29 / 47
47 Shortest-Relative-Deadline First (SDF) with DM (SDF+DM) Input: T, M; 1: re-index (sort) tasks such that D i D j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 10: return feasible task assignment T 1, T 2,..., T M ; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 30 / 47
48 Shortest-Relative-Deadline First (SDF) with DM (SDF+DM) Input: T, M; 1: re-index (sort) tasks such that D i D j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 4: for m = 1 to M do 5: if task τ i can be feasibly scheduled with T m under DM scheduling then 6: assign task τ i onto processor m and T m T m {τ i }; 7: break; 10: return feasible task assignment T 1, T 2,..., T M ; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 30 / 47
49 Shortest-Relative-Deadline First (SDF) with DM (SDF+DM) Input: T, M; 1: re-index (sort) tasks such that D i D j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 4: for m = 1 to M do 5: if task τ i can be feasibly scheduled with T m under DM scheduling then 6: assign task τ i onto processor m and T m T m {τ i }; 7: break; 8: if τ i is not assigned then 9: return The task assignment fails ; 10: return feasible task assignment T 1, T 2,..., T M ; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 30 / 47
50 Shortest-Relative-Deadline First (SDF) with DM (SDF+DM) Input: T, M; 1: re-index (sort) tasks such that D i D j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 4: for m = 1 to M do 5: if task τ i can be feasibly scheduled with T m under DM scheduling then 6: assign task τ i onto processor m and T m T m {τ i }; 7: break; 8: if τ i is not assigned then 9: return The task assignment fails ; 10: return feasible task assignment T 1, T 2,..., T M ; The used test can be an exact test (by using TDA) or a utilization-based analysis. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 30 / 47
51 Constrained-Deadline: Failure when Using TDA Suppose that task τ k is the first task that fails to be assigned on any of the M processors. Let T be the set {τ 1, τ 2,..., τ k 1 }. Therefore, m, t, with 0 < t D k, C k + τ i T m t C i > t. By taking a summation of all the m = 1, 2,..., M inequalities with respect to any t, we have t with 0 < t D k, MC k + t C i > Mt. By taking the negation, we know that if τ i T t with 0 < t D k, and C k + τ i T t C i t, (1) M then the SDF+DM by using TDA should succeed to assign task τ k on one of the M processors. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 31 / 47
52 Constrained-Deadline: Schedulability Test for TDA This is basically very similar to TDA with a minor difference by dividing the higher-priority workload by M. Testing the schedulability condition of task τ k can be done by using the same strategy used in the k 2 U framework. We classify the k 1 tasks in T into two subsets. T 1 consists of the tasks in T with period smaller than D k. T 2 consists of the tasks in T with period larger than or equal to D k. Let C k be defined as follows: C k = C k + M. τ i T 2 C i Now, we can rewrite the condition as follows: if t with 0 < t D k and C k + τ i T 1 t C i M t, then SDF+DM by using TDA should succeed to assign task τ k on one of the M processors. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 32 / 47
53 Recall k-point Effective Schedulability Test: k 2 U Suppose that {t 1, t 2,... t k } are given. Definition A k-point effective schedulability test is a sufficient test by verifying the existence of t j {t 1, t 2,... t k } with t 1 t 2 t k such that k 1 C k + α i t i U i + i=1 j 1 β i t i U i t j, (2) where C k > 0, α i > 0, U i > 0, and β i > 0 are dependent upon the setting of the task models and task τ i. Lemma [Lemma 1] For a given k-point effective schedulability test of a scheduling algorithm, in which 0 < α i α, and 0 < β i β for any i = 1, 2,..., k 1, 0 < t k, task τ k is schedulable by the scheduling algorithm if the following condition holds C k t k i=1 α β + 1 k 1 j=1 (βu j + 1) α β. (3) Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 33 / 47
54 Constrained-Deadline: Utilization-Base Test for TDA Theorem If (1 + U i M ) 2, τ i T C k D k then a constrained-deadline task τ k is schedulable under SDF+DM by using TDA. Proof Let t i be Tk for τ i T 1. When using the k 2 U framework, we can reach the conclusion that α i = 1 M, and 0 < β i 1 M t k is D k and C k (in the previous lemma) is C k. By adopting the above lemma, we reach the conclusion. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 34 / 47
55 Using Utilization-Based Test in SDF+DM Instead of using the exact test, we can also use the utilization-based test (in the hyperbolic form) for deadline-monotonic scheduling (see slide 30 in 11-k2u.pdf). Surprisingly, the result is the same as the case by using TDA analysis. One of your exercise assignments is for the special case by using the hyperbolic form in the schedulability test for RM. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 35 / 47
56 Summary of Existing Results partitioned with EDF partitioned with DM implicit deadlines constrained deadlines arbitrary deadlines M 1969) (Graham (1 + ɛ) (Hochbaum/Shmoys 1987) (bin-packing) 7 4 (Burchard et al. 1995) (bin-packing) 1.5 (Rothvoß2009) 3 1 (Baruah/Fisher 2006) 4 2 (Baruah/Fisher 2005) M M (Chen/Chakraborty 2011) 1 M 3 1 M (Baker/Fisher/Baruah 2009) 3 1 (Chen/Chakraborty 2011) M 4 2 (Baker/Fisher/Baruah 2009) M (Chen 2015) 3 1 (Chen 2015) M The above factors are for speed-up factors, except the two results in partitioned RM scheduling. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 36 / 47
57 Outline Introduction to Multiprocessor Scheduling Partitioned Scheduling for Implicit-Deadline EDF Scheduling Partitioned Scheduling for Implicit-Deadline RM Scheduling Partitioned Scheduling for Constrained-Deadline DM Scheduling Partitioned Scheduling for Arbitrary-Deadline EDF Scheduling Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 37 / 47
58 Demand Bound Function Revisit for EDF Define demand bound function dbf (τ i, t) as { t + Ti D i dbf (τ i, t) = max 0, } C i = max { 0, t Di We need approximation to enforce polynomial-time schedulability test. { 0 if t < dbf Di (τ i, t) = ( t D i + 1)C i otherwise. } + 1 C i. dbf (τ i, t) t Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 38 / 47
59 Demand Bound Function Revisit for EDF Define demand bound function dbf (τ i, t) as { t + Ti D i dbf (τ i, t) = max 0, } C i = max { 0, t Di We need approximation to enforce polynomial-time schedulability test. { 0 if t < dbf Di (τ i, t) = ( t D i + 1)C i otherwise. } + 1 C i. dbf (τ i, t) dbf (τ i, t) t Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 38 / 47
60 Demand Bound Function Revisit for EDF Define demand bound function dbf (τ i, t) as { t + Ti D i dbf (τ i, t) = max 0, } C i = max { 0, t Di We need approximation to enforce polynomial-time schedulability test. { 0 if t < dbf Di (τ i, t) = ( t D i + 1)C i otherwise. } + 1 C i. dbf (τ i, t) dbf (τ i, t) dbf (τ i, t) 2dbf (τ i, t) dbf (τ i, t) t Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 38 / 47
61 Shortest Relative-Deadline First (SDF+EDF) Input: T, M; 1: re-index (sort) tasks such that D i D j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 10: return feasible task assignment T 1, T 2,..., T M ; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 39 / 47
62 Shortest Relative-Deadline First (SDF+EDF) Input: T, M; 1: re-index (sort) tasks such that D i D j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 4: for m = 1 to M do 5: if C i + τ j T m C j T j 1 and C i + τ j T m dbf (τ j, D i ) D i then 6: assign task τ i onto processor m and T m T m {τ i }; 7: break; 10: return feasible task assignment T 1, T 2,..., T M ; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 39 / 47
63 Shortest Relative-Deadline First (SDF+EDF) Input: T, M; 1: re-index (sort) tasks such that D i D j for i < j; 2:, U i 0, m = 1, 2,..., M; 3: for i = 1 to N, where N = T do 4: for m = 1 to M do 5: if C i + τ j T m C j T j 1 and C i + τ j T m dbf (τ j, D i ) D i then 6: assign task τ i onto processor m and T m T m {τ i }; 7: break; 8: if τ i is not assigned then 9: return The task assignment fails ; 10: return feasible task assignment T 1, T 2,..., T M ; Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 39 / 47
64 Feasibility Theorem If the tasks are partitioned successfully by using SDF+EDF Partition, EDF can feasibly schedule the tasks. This is due to the feasibility analysis of the linear approximation of the demand bound functions. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 40 / 47
65 When Is SDF+EDF Always Successful? Define that δ max is the maximum density, i.e., max τi T C i D i. µ max is the maximum utilization, i.e., max τi T C i. δ max and µ max are both less than or equal to 1. δsum is the maximum total dbf density, i.e., max t>0 τ i T dbf (τ i,t) t. µsum is the total utilization, i.e., τ i T C i. Theorem Any sporadic task set is successfully scheduled by SDF+EDF on M identical processors, when M 2δ sum δ max 1 δ max + µ sum µ max 1 µ max. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 41 / 47
66 Proof of Schedulability Suppose that τ k is not able to be assigned on any processor by SDF+EDF. Either C k T k + C j τ j T m T j > 1 or C k + τ j T dbf (τ j, D k ) > D k. m Suppose that among M processors, there are M 1 processors, denoted by set M 1, with C k + τ j T dbf (τ j, D k ) > D k. m Therefore, by summing the inequalities together, we have M 1 C k + dbf (τ j, D k ) > M 1 D k. τ j T m and m M 1 2dbf (τ j, D k ) > M 1 (D k C k ) τ j T\{τ k } 2dbf (τ j, D k ) > M 1 (D k C k ) + C k τ j T divided by D k τ j T 2dbf (τ j, D k ) D k 2δsum > M 1 D k C k D k By above, we know that M 1 < 2δ sum C k D k. 1 C k D k > M 1 D k C k D k + C k D k + C k D k Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 42 / 47
67 Proof of Schedulability M 2 = M M 1 processors are purely with C k T k + C j τ j T m T j > 1. Similarly, M 2 < µ sum C k T k. 1 C k T k As a result, it can be shown that M = M 1 + M 2 < 2δ sum δ max 1 δ max + µ sum µ max 1 µ max. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 43 / 47
68 Resource Augmentation Theorem If a sporadic task set is schedulable on M identical processors, SDF+EDF will successfully partition this task set upon a platform comprised of M processors that are each (4 2 M ) times as fast as the original. Proof The necessary condition to be schedulable on M identical processors is δ max 1, µ max 1, µsum M, and δsum M. If speeding up by 1 γ satisfies M 2δ sum δmax 1 δ max by applying SDF+EDF. Therefore, + µ sum µmax 1 µ max, it is feasible 2δsum δ max + µ sum µ max 2Mγ γ + Mγ γ 1 δ max 1 µ max 1 γ 1 γ If M 3Mγ 2γ 1 γ, the schedulability is enforced. 4 2 M 1 γ. = 3Mγ 2γ 1 γ Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 44 / 47
69 SDF+EDF for Constrained Deadlines Theorem Any sporadic task set with constrained deadlines is successfully scheduled by SDF+EDF on M identical processors, when M 2δ sum δ max 1 δ max. Theorem If a sporadic task set with constrained deadlines is schedulable on M identical processors, SDF+EDF will successfully partition this task set upon a platform comprised of M processors that are each (3 1 M ) times as fast as the original. Main difference: Condition C i + τ j T m enforced when C i + τ j T m dbf (τ j, D i ) D i holds. ( M 2 is always 0). C j T j 1 in Step 5 is always Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 45 / 47
70 Feasibility Theorem [Fisher and Baruah, RTSS 2005] The resource augmentation factor for SDF+EDF has a 4 2 M resource augmentation factor for tasks with arbitrary deadlines a 3 1 M resource augmentation factor for tasks with constrained deadlines Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 46 / 47
71 Feasibility Theorem [Fisher and Baruah, RTSS 2005] The resource augmentation factor for SDF+EDF has a 4 2 M resource augmentation factor for tasks with arbitrary deadlines a 3 1 M resource augmentation factor for tasks with constrained deadlines Theorem [Chen and Chakraborty, RTSS 2011] The SDF+EDF has a 3 1 M resource augmentation factor for tasks with arbitrary deadlines a 3e 1 e 1 M M resource augmentation factor for tasks with constrained deadlines Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 46 / 47
72 Summary of Existing Results partitioned with EDF partitioned with DM implicit deadlines constrained deadlines arbitrary deadlines M 1969) (Graham (1 + ɛ) (Hochbaum/Shmoys 1987) (bin-packing) 7 4 (Burchard et al. 1995) (bin-packing) 1.5 (Rothvoß2009) 3 1 (Baruah/Fisher 2006) 4 2 (Baruah/Fisher 2005) M M (Chen/Chakraborty 2011) 1 M 3 1 M (Baker/Fisher/Baruah 2009) 3 1 (Chen/Chakraborty 2011) M 4 2 (Baker/Fisher/Baruah 2009) M (Chen 2015) 3 1 (Chen 2015) M The above factors are for speed-up factors, except the two results in partitioned RM scheduling. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 47 / 47
Multiprocessor 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 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 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 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 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 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 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 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 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. 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 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 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 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 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 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 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 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 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 informationScheduling Parallel Jobs with Linear Speedup
Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl
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 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 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 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 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 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 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 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 informationEnergy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems
Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems Jian-Jia Chen *, Chuan Yue Yang, Tei-Wei Kuo, and Chi-Sheng Shih Embedded Systems and Wireless Networking Lab. Department of Computer
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 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 informationThe Concurrent Consideration of Uncertainty in WCETs and Processor Speeds in Mixed Criticality Systems
The Concurrent Consideration of Uncertainty in WCETs and Processor Speeds in Mixed Criticality Systems Zhishan Guo and Sanjoy Baruah Department of Computer Science University of North Carolina at Chapel
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 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 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 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 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 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 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-line Bin-Stretching. Yossi Azar y Oded Regev z. Abstract. We are given a sequence of items that can be packed into m unit size bins.
On-line Bin-Stretching Yossi Azar y Oded Regev z Abstract We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try
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 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 informationScheduling periodic Tasks on Multiple Periodic Resources
Scheduling periodic Tasks on Multiple Periodic Resources Xiayu Hua, Zheng Li, Hao Wu, Shangping Ren* Department of Computer Science Illinois Institute of Technology Chicago, IL 60616, USA {xhua, zli80,
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 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 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 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 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 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 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 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 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 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 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 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 informationReservation-Based Federated Scheduling for Parallel Real-Time Tasks
Reservation-Based Federated Scheduling for Parallel Real-Time Tasks Niklas Ueter 1, Georg von der Brüggen 1, Jian-Jia Chen 1, Jing Li 2, and Kunal Agrawal 3 1 TU Dortmund University, Germany 2 New Jersey
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 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 informationThe preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems Sanjoy Baruah 1 Vincenzo Bonifaci 2 3 Haohan Li 1 Alberto Marchetti-Spaccamela 4 Suzanne Van Der Ster
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 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 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 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 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 informationAPTAS for Bin Packing
APTAS for Bin Packing Bin Packing has an asymptotic PTAS (APTAS) [de la Vega and Leuker, 1980] For every fixed ε > 0 algorithm outputs a solution of size (1+ε)OPT + 1 in time polynomial in n APTAS for
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 informationMachine scheduling with resource dependent processing times
Mathematical Programming manuscript No. (will be inserted by the editor) Alexander Grigoriev Maxim Sviridenko Marc Uetz Machine scheduling with resource dependent processing times Received: date / Revised
More informationA Robust APTAS for the Classical Bin Packing Problem
A Robust APTAS for the Classical Bin Packing Problem Leah Epstein 1 and Asaf Levin 2 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il 2 Department of Statistics,
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 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 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 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 informationOn the Soft Real-Time Optimality of Global EDF on Uniform Multiprocessors
On the Soft Real-Time Optimality of Global EDF on Uniform Multiprocessors Kecheng Yang and James H Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract It has long
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More informationPreemptive Online Scheduling: Optimal Algorithms for All Speeds
Preemptive Online Scheduling: Optimal Algorithms for All Speeds Tomáš Ebenlendr Wojciech Jawor Jiří Sgall Abstract Our main result is an optimal online algorithm for preemptive scheduling on uniformly
More informationMixed-criticality scheduling upon varying-speed multiprocessors
Mixed-criticality scheduling upon varying-speed multiprocessors Zhishan Guo Sanjoy Baruah The University of North Carolina at Chapel Hill Abstract An increasing trend in embedded computing is the moving
More informationCache-Aware Compositional Analysis of Real- Time Multicore Virtualization Platforms
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science -25 Cache-Aware Compositional Analysis of Real- Time Multicore Virtualization Platforms
More informationBin packing and scheduling
Sanders/van Stee: Approximations- und Online-Algorithmen 1 Bin packing and scheduling Overview Bin packing: problem definition Simple 2-approximation (Next Fit) Better than 3/2 is not possible Asymptotic
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 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 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 2: Scheduling on Parallel Machines
Lecture 2: Scheduling on Parallel Machines Loris Marchal October 17, 2012 Parallel environment alpha in Graham s notation): P parallel identical Q uniform machines: each machine has a given speed speed
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 informationContention-Free Executions for Real-Time Multiprocessor Scheduling
Contention-Free Executions for Real-Time Multiprocessor Scheduling JINKYU LEE, University of Michigan ARVIND EASWARAN, Nanyang Technological University INSIK SHIN, KAIST A time slot is defined as contention-free
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 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 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 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 informationMultiprocessor EDF and Deadline Monotonic Schedulability Analysis
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis Ted Baker Department of Computer Science Florida State University Tallahassee, FL 32306-4530 http://www.cs.fsu.edu/ baker Overview 1. question
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 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 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 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 informationA PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
A PAS for Static Priority Real-ime Scheduling with Resource Augmentation echnical Report Friedrich Eisenbrand and homas Rothvoß Institute of Mathematics EPFL, Lausanne, Switzerland {friedrich.eisenbrand,thomas.rothvoss}@epfl.ch
More informationMIRROR: Symmetric Timing Analysis for Real-Time Tasks on Multicore Platforms with Shared Resources
MIRROR: Symmetric Timing Analysis for Real-Time Tasks on Multicore Platforms with Shared Resources Wen-Hung Huang, Jian-Jia Chen Department of Computer Science TU Dortmund University, Germany wen-hung.huang@tu-dortmund.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 informationMultiprocessor feasibility analysis of recurrent task systems with specified processor affinities
Multiprocessor feasibility analysis of recurrent task systems with specified processor affinities Sanjoy Baruah The University of North Carolina baruah@cs.unc.edu Björn Brandenburg Max Planck Institute
More informationModule 5: CPU Scheduling
Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained
More informationUniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate
Uniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate Zhishan Guo 1, Kecheng Yang 2, Sudharsan Vaidhun 1, Samsil Arefin 3, Sajal K. Das 3, Haoyi Xiong 4 1 Department of
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained
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 information