On the Design and Application of Thermal Isolation Servers
|
|
- Maximilian Small
- 6 years ago
- Views:
Transcription
1 On the Design and Application of Thermal Isolation Servers Rehan Ahmed, Pengcheng Huang, Max Millen, Lothar Thiele EMSOFT 2017 October 16, /25
2 2/25 The Temperature Problem 1 1 Extremetech: 2 CPU DB: Recording Microprocessor History : 3 TECHPOWERUP:
3 2/25 The Temperature Problem Extremetech: 2 CPU DB: Recording Microprocessor History : 3 TECHPOWERUP:
4 2/25 The Temperature Problem Extremetech: 2 CPU DB: Recording Microprocessor History : 3 TECHPOWERUP:
5 2/25 The Temperature Problem Deadline miss 1 Extremetech: 2 CPU DB: Recording Microprocessor History : 3 TECHPOWERUP:
6 2/25 The Temperature Problem Deadline miss τ τ 1 s deadline 1 Extremetech: 2 CPU DB: Recording Microprocessor History : 3 TECHPOWERUP:
7 2/25 The Temperature Problem Deadline miss τ 2 τ τ 1 s deadline 1 Extremetech: 2 CPU DB: Recording Microprocessor History : 3 TECHPOWERUP:
8 2/25 The Temperature Problem Deadline miss DTM τ 2 τ 1 τ τ 1 s deadline 1 Extremetech: 2 CPU DB: Recording Microprocessor History : 3 TECHPOWERUP:
9 3/25 Multicore Makes Things Harder 1. Inter core thermal interactions. Core 0 Core 1 τ 2 DTM Core 2 Core 3 τ
10 3/25 Multicore Makes Things Harder 1. Inter core thermal interactions. Core 0 Core 1 τ 2 DTM Core 2 Core 3 τ Rise/fall in temperature may be non-monotonic. Core 0 25 Core 2 25 Core 1 25 Core 3 25 time C0 Temperature
11 3/25 Multicore Makes Things Harder 1. Inter core thermal interactions. Core 0 Core 1 τ 2 DTM Core 2 Core 3 τ Rise/fall in temperature may be non-monotonic. Core 0 25 Core 2 25 Core 1 25 Core 3 25 Core 0 50 Core 2 0 Core 1 0 Core 3 0 time C0 Temperature
12 4/25 Mixed-Criticality Complicates Problem Further LO DTM HI Task that heats up the processor may be low criticality. Task that suffers due to deadline violation may be high criticality. Certification demands isolation.
13 5/25 Related Research Unicore: Wang and Bettati (2006), Chen, Wang, and Thiele (2009), Kumar and Thiele (2011), M. Ahmed et al. (2011). Multicore: Chantem, Dick, and Hu (2011), Fisher et al. (2009), R. Ahmed, Ramanathan, and Saluja (2016). Temperature bounding: Schor, Bacivarov, et al. (2012) and Schor, Yang, et al. (2011)
14 5/25 Related Research Unicore: Wang and Bettati (2006), Chen, Wang, and Thiele (2009), Kumar and Thiele (2011), M. Ahmed et al. (2011). Multicore: Chantem, Dick, and Hu (2011), Fisher et al. (2009), R. Ahmed, Ramanathan, and Saluja (2016). Temperature bounding: Schor, Bacivarov, et al. (2012) and Schor, Yang, et al. (2011) Common limitations: 1. No schemes proposed for mixed-critical applications. 2. Current schemes solve the temperature minimization problem, NOT the temperature isolation problem.
15 6/25 Contributions 1. Propose Thermal Isolation Servers Provide thermal isolation by construction. Can bound the temperature increase caused by a set of tasks. Time and space composable. Can schedule tasks based on both dynamic and fixed priority. 2. Validated on a hardware platform. Mixed-critical flight management system.
16 7/25 Thermal Model Fundamentals to upper layer to upper layer R 12 =R 21 R 23 =R 32 T 1 T 2 T 3 1/K 11 1/K 22 1/K 33 T A C 11 P 1 T A C T A 22 P 2 C 33 P 3 Model T (t) = A T (t) + B(t) Where A = C 1 (G + φ K) and B(t) = C 1 (K T A + ψ(t)) Steady state T (B(0)) = A 1 B(0) Thermal model solution T (t) = e A t (T (0) T (B(0)) + T (B(0))
17 8/25 Thermal Component Based Analysis Thermal component Θ(t, z): Temperature increase caused by a given execution. z st z e z cr z
18 8/25 Thermal Component Based Analysis Thermal component Θ(t, z): Temperature increase caused by a given execution. z st z e z cr z Temperature ( C) Cooling component Θ(t, z 1) τ Θ(t, z 2) Time (sec) = τ 2 = Overall temperature Core Core
19 9/25 Thermal Isolation Servers A given Thermal Isolation Server (TIS) S i is a statically scheduled periodic resource characterized by the following attributes: P i = 3 U i P i = 2 φ i = P i : Period 2. U i : Utilization 3. φ i : Phase 4. cr i : Core where S i is executed. Also called self core 5. Π i : Taskset assigned to S i 6. Λ i : Thermal budget. Function of Pi, U i and cr i
20 10/25 TIS Temperature Guarantees Thermal budget increases with Utilization. Thermal budget increases with Period. Fluid server is optimal. Server period is infinitesimally small. Not practical. Λ i 1 ( C) Ui Pi (s)
21 Temperature 10/25 TIS Temperature Guarantees Thermal budget increases with Utilization. Thermal budget increases with Period. Fluid server is optimal. Server period is infinitesimally small. Not practical. Schedule 1 Schedule 2 Fluid Λ i 1 ( C) Ui Pi (s) Time Schedule 2 Schedule 1 Time
22 11/25 TIS Temperature Guarantees Augmented Utilization: U i (ɛ) = max(p i U i ɛ, 0) P i
23 11/25 TIS Temperature Guarantees Augmented Utilization: U i (ɛ) = max(p i U i ɛ, 0) P i Augmented Utilization Λ i i = 5 C ɛ = 0 ɛ = 10µs ɛ = 50µs ɛ = 100µs Period (s) Maximum utilization point is non-zero. Favor high period servers when ɛ is large and vice-versa.
24 12/25 TIS Timing Guarantees Supply Bound Function of TIS: sbf(s i, l, ɛ) = l/p i P i U i (ɛ) + max {l P i (1 U i (ɛ)) l/p i P i, 0} Demand Bound Function dbf EDF (Π, l) = τ j Π max {( (l D j )/W j + 1) E j, 0} 4 3 sbf(s i, l, ɛ) dbf EDF ({τ j }, l) U i(ɛ)p i = P i = 2 1 E j = 0.8 D j = W j = 2.0 l
25 13/25 Composability of Servers Theorem 5.8: Given n TISs, the maximum temperature increase due to their execution is upper bounded by: 1 i n Λ i Temporal composability Spacial composability S 2 S 1 S 2 S Restrictive due to same period. Possibly better to have one larger server. S 1 S 1 S 2 S No same period restriction. Servers can be designed independently.
26 14/25 Design heuristic taskset partition tasks Partitioned tasks Search TISs TIS configurations MILP formulation: Minimize maximum temperature for period = 0. Utilization of each core is 1. For each core, search TIS such that: Conditions for timing feasibility are satisfied. Termal budget is minimized. Schedule
27 15/25 Setup: Evaluation Tasks: Synthetically generated, harmonic, implicit deadline periodic tasks. Platform: 8 mm Core0 Core1 Core2 Core3 8 mm Scheduling schemes: Parameter ψ active ψ idle φ T A Value 70 W 20 W zero matrix 25 C WF_EDF_x: Tasks partitioned using worst-fit bin packing. EDF scheduling used. x specifies the preemption overhead in µs. Opt_TIS_x: Tasks are scheduled using TISs. x is the server overhead (ɛ) in µs. EDF used within server active time.
28 16/25 Evaluation 1.00 Schedulability Opt TIS 0 Opt TIS 20 Opt TIS 50 WF EDF Utilization Thermal isolation has low cost. May even improve schedulability!!
29 17/25 Emulation Platform: Lenovo Thinkpad T440p (Core i7-4700mq quad-core processor). Operating frequency of all cores set to max (3.2 GHz). Fan speed set to max. OS: Ubuntu with preempt-rt. Augmented SF3P[Sigrist et al. (2015)] scheduling framework. Thermal constraint = 70 C 4 4
30 18/25 Emulation Application: Flight management system: Purpose CL # P(ms)E (ms) Sensor data acquisition HI HI Localization HI HI Flight-plan HI management LO HI HI Flight-plan HI computation HI HI HI Guidance HI Nearest AirportLO How to design TISs So that there is no thermal violation? How to guarantee this? 5
31 18/25 Emulation Application: Flight management system: Purpose CL # P(ms)E (ms) Sensor data acquisition HI HI Localization HI HI Flight-plan HI management LO HI HI Flight-plan HI computation HI HI HI Guidance HI Nearest AirportLO C0 SF3P C1 LO EDF C2 HI TIS C3 HI TIS How to design TISs So that there is no thermal violation? How to guarantee this? 5
32 19/25 Emulation Step 1: Determine the available thermal budget for TISs Perform thermal callibration tests to determine the peak temperature caused by execution of LO tasks on core 1 (T LO ). Available thermal budget: T T LO = [16, 28.88, 27.4]
33 19/25 Emulation Step 1: Determine the available thermal budget for TISs Perform thermal callibration tests to determine the peak temperature caused by execution of LO tasks on core 1 (T LO ). Available thermal budget: T T LO = [16, 28.88, 27.4] Step 2: Determine the thermal model Steady state: Directly from calibration tests. Transient: Estimating the temperature transfer function.
34 19/25 Emulation Step 1: Determine the available thermal budget for TISs Perform thermal callibration tests to determine the peak temperature caused by execution of LO tasks on core 1 (T LO ). Available thermal budget: T T LO = [16, 28.88, 27.4] Step 2: Determine the thermal model Steady state: Directly from calibration tests. Transient: Estimating the temperature transfer function. Step 3: Design TISs Partition HI tasks to cores 2 and 3 Search for servers Verify that total budget is less than T T LO.
35 20/25 Emulation Worst-Fit with EDF Temperature ( C) Core Core Time (sec) Core Thermal constraint is violated!
36 21/25 Emulation Temperature ( C) Core 1 70 bound= Our Aproach Core 2 bound= Time (sec) Core 3 bound= S 1 : P 1 = 10ms, U 1 = 0.693, cr 1 = 2, Λ 1 = [6.42, 14.62, 5.69] S 2 : P 1 = 10ms, U 1 = 0.546, cr 2 = 3 Λ 2 = [3.75, 5.90, 14.24] Bound = T LO + Λ 1 + Λ 2
37 22/25 Takeaways... Proposed a TISs which provide thermal isolation on a multicore by construction. Temporal and spacial composability. Static or dynamic priority scheduling. Proposed a heuristic to approach to design TISs. Schedulability cost of providing thermal isolation is small. Emulated the TIS on a hardware platform to validate theory.
38 Questions?? 23/25
39 24/25 Backup 1 Following three calibration tests are performed: 1. Test1: Core 1 executing LO using EDF. Cores 2 and 3 idle. 2. Test2: Core 1 executing LO using EDF. Cores 2, 3 active. 3. Test3: Core 1 always idle. Cores 2 and 3 active. T [ P 99.9(T (t, Test1)) 1 P 99.9(T (t, Test2)) 2 P 99.9(T (t, Test3)) 2 + [T (B idle )] 2 P 99.9(T (t, Test2)) 3 P 99.9(T (t, Test3)) 3 + [T (B idle )] 3 ] = [ ]
40 25/25 Backup core-i7-2600k-i5-2500k-core-i tested
Segment-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 informationCache-Aware Compositional Analysis of Real- Time Multicore Virtualization Platforms
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science 12-2013 Cache-Aware Compositional Analysis of Real- Time Multicore Virtualization Platforms
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 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 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 informationCycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators
CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators Sandeep D souza and Ragunathan (Raj) Rajkumar Carnegie Mellon University High (Energy) Cost of Accelerators Modern-day
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 informationTemperature-Aware Analysis and Scheduling
Temperature-Aware Analysis and Scheduling Lothar Thiele, Pratyush Kumar Overview! Introduction! Power and Temperature Models! Analysis Real-time Analysis Worst-case Temperature Analysis! Scheduling Stop-and-go
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 informationComponent-based Analysis of Worst-case Temperatures
Component-based Analysis of Worst-case Temperatures Lothar Thiele, Iuliana Bacivarov, Jian-Jia Chen, Devendra Rai, Hoeseok Yang 1 How can we analyze timing properties in a compositional framework? 2 Modular
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 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 informationDesign and Analysis of Time-Critical Systems Response-time Analysis with a Focus on Shared Resources
Design and Analysis of Time-Critical Systems Response-time Analysis with a Focus on Shared Resources Jan Reineke @ saarland university ACACES Summer School 2017 Fiuggi, Italy computer science Fixed-Priority
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 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 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 informationTowards Overhead-Free Interface Theory for Compositional Hierarchical Real-Time Systems
University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science 5-2-218 Towards Overhead-Free Interface Theory for Compositional Hierarchical Real-Time
More informationProactive Speed Scheduling for Real-Time Tasks under Thermal Constraints
Proactive Speed Scheduling for Real-Time Tasks under Thermal Constraints Jian-Jia Chen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, Switzerland jchen@tik.ee.ethz.ch Shengquan Wang Department
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 informationSchedulability analysis of global Deadline-Monotonic scheduling
Schedulability analysis of global Deadline-Monotonic scheduling Sanjoy Baruah Abstract The multiprocessor Deadline-Monotonic (DM) scheduling of sporadic task systems is studied. A new sufficient schedulability
More informationTask Models and Scheduling
Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling
More informationMultiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling II: Global Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 28, June, 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 42 Global Scheduling We will only focus on identical
More informationReal-time Systems: 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 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 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 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 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 informationProcess Scheduling for RTS. RTS Scheduling Approach. Cyclic Executive Approach
Process Scheduling for RTS Dr. Hugh Melvin, Dept. of IT, NUI,G RTS Scheduling Approach RTS typically control multiple parameters concurrently Eg. Flight Control System Speed, altitude, inclination etc..
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 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 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 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 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 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 informationEmbedded Systems Design: Optimization Challenges. Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden
of /4 4 Embedded Systems Design: Optimization Challenges Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden Outline! Embedded systems " Example area: automotive electronics " Embedded systems
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 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 informationAn Optimal Semi-Partitioned Scheduler for Uniform Heterogeneous Multiprocessors
An Optimal Semi-Partitioned Scheduler for Uniform Heterogeneous Multiprocessors Kecheng Yang and James H. Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract A
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 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 informationThermal-Aware Global Real-Time Scheduling on Multicore Systems
Thermal-Aware Global Real-Time Scheduling on Multicore Systems Nathan Fisher a, Jian-Jia Chen b, Shengquan Wang c, Lothar Thiele b a Department of Computer Science, Wayne State University, USA b Computer
More informationAnalysis and Implementation of Global Preemptive Fixed-Priority Scheduling with Dynamic Cache Allocation*
Analysis and Implementation of Global Preemptive Fixed-Priority Scheduling with Dynamic Cache Allocation* Meng Xu Linh Thi Xuan Phan Hyon-Young Choi Insup Lee University of Pennsylvania Abstract We introduce
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 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 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 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 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 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 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 informationA Dynamic Real-time Scheduling Algorithm for Reduced Energy Consumption
A Dynamic Real-time Scheduling Algorithm for Reduced Energy Consumption Rohini Krishnapura, Steve Goddard, Ala Qadi Computer Science & Engineering University of Nebraska Lincoln Lincoln, NE 68588-0115
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 informationOnline Work Maximization under a Peak Temperature Constraint
Online Work Maximization under a Peak Temperature Constraint Thidapat Chantem Department of CSE University of Notre Dame Notre Dame, IN 46556 tchantem@nd.edu X. Sharon Hu Department of CSE University of
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 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 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 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 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 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 informationSemi-Partitioned Scheduling of Sporadic Task Systems on Multiprocessors
Semi-Partitioned Scheduling of Sporadic Task Systems on Multiprocessors Shinpei Kato, Nobuyuki Yamasaki, and Yutaka Ishikawa Department of Computer Science, The University of Tokyo, Tokyo, Japan Department
More informationProportional Share Resource Allocation Outline. Proportional Share Resource Allocation Concept
Proportional Share Resource Allocation Outline Fluid-flow resource allocation models» Packet scheduling in a network Proportional share resource allocation models» CPU scheduling in an operating system
More informationEDF Scheduling. Giuseppe Lipari May 11, Scuola Superiore Sant Anna Pisa
EDF Scheduling Giuseppe Lipari http://feanor.sssup.it/~lipari Scuola Superiore Sant Anna Pisa May 11, 2008 Outline 1 Dynamic priority 2 Basic analysis 3 FP vs EDF 4 Processor demand bound analysis Generalization
More informationReal-Time Scheduling and Resource Management
ARTIST2 Summer School 2008 in Europe Autrans (near Grenoble), France September 8-12, 2008 Real-Time Scheduling and Resource Management Lecturer: Giorgio Buttazzo Full Professor Scuola Superiore Sant Anna
More informationMultiprocessor Scheduling of Age Constraint Processes
Multiprocessor Scheduling of Age Constraint Processes Lars Lundberg Department of Computer Science, University of Karlskrona/Ronneby, Soft Center, S-372 25 Ronneby, Sweden, email: Lars.Lundberg@ide.hk-r.se
More 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 informationEnergy-Efficient Speed Scheduling for Real-Time Tasks under Thermal Constraints
Energy-Efficient Speed Scheduling for Real-Time Tasks under Thermal Constraints Shengquan Wang, Jian-Jia Chen, Zhenjun Shi, and Lothar Thiele Abstract Thermal constraints have limited the performance improvement
More informationENERGY EFFICIENT SCHEDULING FOR REAL-TIME SYSTEMS. A Dissertation NIKHIL GUPTA
ENERGY EFFICIENT SCHEDULING FOR REAL-TIME SYSTEMS A Dissertation by NIKHIL GUPTA Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree
More informationEfficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems
Efficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems Yifeng Guo, Dakai Zhu The University of Texas at San Antonio Hakan Aydin George Mason University Outline Background and Motivation
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 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 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 informationFailure Tolerance of Multicore Real-Time Systems scheduled by a Pfair Algorithm
Failure Tolerance of Multicore Real-Time Systems scheduled by a Pfair Algorithm Yves MOUAFO Supervisors A. CHOQUET-GENIET, G. LARGETEAU-SKAPIN OUTLINES 2 1. Context and Problematic 2. State of the art
More informationScheduling. Uwe R. Zimmer & Alistair Rendell The Australian National University
6 Scheduling Uwe R. Zimmer & Alistair Rendell The Australian National University References for this chapter [Bacon98] J. Bacon Concurrent Systems 1998 (2nd Edition) Addison Wesley Longman Ltd, ISBN 0-201-17767-6
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 informationTDDB68 Concurrent programming and operating systems. Lecture: CPU Scheduling II
TDDB68 Concurrent programming and operating systems Lecture: CPU Scheduling II Mikael Asplund, Senior Lecturer Real-time Systems Laboratory Department of Computer and Information Science Copyright Notice:
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 informationEnergy-Efficient Speed Scheduling for Real-Time Tasks under Thermal Constraints
Energy-Efficient Speed Scheduling for Real-Time Tasks under Thermal Constraints Shengquan Wang, Jian-Jia Chen, Zhenjun Shi, and Lothar Thiele Department of Computer and Information Science University of
More informationThroughput Maximization for Intel Desktop Platform under the Maximum Temperature Constraint
2011 IEEE/ACM International Conference on Green Computing and Communications Throughput Maximization for Intel Desktop Platform under the Maximum Temperature Constraint Guanglei Liu 1, Gang Quan 1, Meikang
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 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 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 informationOptimal Semi-Partitioned Scheduling in Soft Real-Time Systems
Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems James H. Anderson 1, Benjamin N. Casses 1, UmaMaheswari C. Devi 2, and Jeremy P. Erickson 1 1 Dept. of Computer Science, University of North
More informationCool Shapers: Shaping Real-Time Tasks for Improved Thermal Guarantees
Cool Shapers: Shaping Real-Time Tasks for Improved Thermal Guarantees Pratyush Kumar and Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zürich {pratyush.kumar, lothar.thiele}@tik.ee.ethz.ch
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 informationTardiness Bounds for EDF Scheduling on Multi-Speed Multicore Platforms
Tardiness Bounds for EDF Scheduling on Multi-Speed Multicore Platforms Hennadiy Leontyev and James H. Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract Multicore
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 informationReliability-aware Thermal Management for Hard Real-time Applications on Multi-core Processors
Reliability-aware Thermal Management for Hard Real-time Applications on Multi-core Processors Vinay Hanumaiah Electrical Engineering Department Arizona State University, Tempe, USA Email: vinayh@asu.edu
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 informationOptimal Semi-Partitioned Scheduling in Soft Real-Time Systems
Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems James H. Anderson 1, Jeremy P. Erickson 1, UmaMaheswari C. Devi 2, and Benjamin N. Casses 1 1 Dept. of Computer Science, University of North
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 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 informationImproved Schedulability Analysis of EDF Scheduling on Reconfigurable Hardware Devices
Improved Schedulability Analysis of EDF Scheduling on Reconfigurable Hardware Devices Nan Guan 1, Zonghua Gu 2, Qingxu Deng 1, Weichen Liu 2 and Ge Yu 1 1 Dept of Computer Science and Engineering 2 Dept
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 informationProbabilistic Preemption Control using Frequency Scaling for Sporadic Real-time Tasks
Probabilistic Preemption Control using Frequency Scaling for Sporadic Real-time Tasks Abhilash Thekkilakattil, Radu Dobrin and Sasikumar Punnekkat Mälardalen Real-Time Research Center, Mälardalen University,
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 informationChe-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University
Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.
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 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 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 informationReal-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm
Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should
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 information