Mixed Criticality in Safety-Critical Systems. LS 12, TU Dortmund
|
|
- Stephany Douglas
- 5 years ago
- Views:
Transcription
1 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
2 Motivation today s embedded systems use complex networks hundreds of functions thousands of tasks 50+ ECUs (electronic control units) networked control many suppliers heterogeneous networks are an efficient platform for systems integration Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 2 / 25
3 Example: Mercedes-Benz E-Class source: T. Bone, Daimler Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 3 / 25
4 Safety Challenge Embedded systems are increasingly used to implement advanced system features improve safety In such cases, the embedded system inherits the safety and dependability requirements of the system function safety related embedded systems Such functions are no longer simple They are often distributed Example: automotive electronics brake system camera-based object recognition and tracking Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 4 / 25
5 Safety Standards The design of safety-related systems is driven by safety standards Safety standards contain rules and regulations for all design system recommended guidelines for the development process Safety standards cover all stages of the development process specification design implementation test maintenance Objective of safety related design avoid unacceptable risk assure functional safety Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 5 / 25
6 Functional Safety Safety: Freedom from unacceptable risk of physical injury or of damage to the health of people Functional safety: refers to the safety of system functions A safe system can handle faults without causing severe functional failures Risk: frequency of hazardous events severity of hazardous events Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 6 / 25
7 Embedded Systems Functional Failures Embedded system (ES) functional failures are not necessarily catastrophic Effect depends on the importance of the failing function for the overall system function criticality Criticality depends on the overall system functionality fail safe (ES is not critical but important for quality): if the ES function fails there is a safe function backup or a safe system state that avoids severe consequences (mechanical steering, hydraulic brake, emergency stop) fail operational (ES function is critical, but possibly only needs a specific function): the function continues based on system redundancy or turns to an error mode with reduced functionality (graceful degradation) Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 7 / 25
8 Safety and Time Criticality Many safety critical systems have hard deadlines Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 8 / 25
9 Embedded System Functional Failures and Timing ES functions have different criticality depending on the overall system where timing is specified, it becomes part of the function criticality ES timing failures are ES functional failures switching to error modes is time critical switching needs hard deadlines to guarantee overall system function Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 9 / 25
10 IEC Overview Functional Safety of Electrical/Electronic/Programmable Electronic Safety-related Systems basic functional safety standard applicable to industry generic standard for safety-related systems Metric: Safety Integrity Level - SIL defines four degrees of safety: from 1 (lowest) to 4 (highest) specification of maximum failure rates for each level Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 10 / 25
11 Merging Functions with Different Criticality Levels Integration on one platform leads to systems with applications of different safety requirements strict separation too expensive mixed (safety) criticality systems Mutual dependency via platform and sensors/actuators requires safety concept and qualification/certification for all functions Safety is highly relevant aspect in embedded systems integration Sharing resources is hard to avoide in cost efficient systems shared (open) network shared on-chip network, shared memories, etc. Is it possible to integrate several subsystems and avoid interference? This would be important for mixed criticality systems: non-critical parts are less verified and not designed for worst case It would reduce verification/certification/integration cost Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 11 / 25
12 Mixed Criticality Task Scheduling Given a task τ i, with criticality level L i (Let s assume that the higher number is more critical) Defense avionics: 2 (3) criticalities, says safety-critical; mission-critical; non-critical Civilian aviation (DO-178B): 5 criticalities, says catastrophic; hazardous; major; minor; no effect Automotive systems (ISO 26262): 4 criticalities Worst-case execution time function C i (1), C i (2),... A high criticality task may be subject to pessimistic static analysis A medium criticality task may be subject to worst-case measurement, plus a safety margin A low criticality task may be assessed by simple limited measurement (worst seen in a small number of runs) We can assume that C i (j) C i (j + 1) Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 12 / 25
13 Mixed Criticality Task Scheduling (cont.) Let s consider how to verify the schedulability by using the knowledge we learned in the course. Consider a set T of periodic tasks with implicit deadlines Consider two criticality levels: HI: high criticality (C i (2) will be considered) LO: low criticality (C i (1) will be considered) A task τ i is either specified as a HI task (L i = 2) or a LO task (L i = 1) Let HI be the set of HI tasks Let LO be the set of LO tasks When the system is in HI, all the HI tasks should be feasibly scheduled by considering that C i (2) is the WCET. When the system is in LO, all the tasks should be feasibly scheduled by considering that C i (1) is the WCET. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 13 / 25
14 Criticality Monotonic All HI tasks have priorities higher than all LO tasks Rate monotonic within each class All HI tasks τ i HI use C i (2) All LO tasks τ i LO use C i (1) What s the schedulability condition for such a mixed-criticality scheduling? t T i C i (L i ) + τ j hp(τ i ) t T j C j (L j ) t τ i where hp(τ i ) is the set of tasks with higher priority than τ i. Quiz: Is Criticality Monotonic the best strategy? Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 14 / 25
15 Intermingled Priorities Priorities of HI and LO are intermingled When analysing HI tasks, HI tasks use C i (2), but LO tasks use C i (1) At run-time, tasks τ i in LO must be prevented from executing for more than C i (1) When analysing LO tasks, all tasks use C i (LO). Disadvantage: execution times must be monitored Let s first assume hp(τ i ) is given. What s the schedulability condition for such a mixed-criticality scheduling? t T i C i (L i ) + τ j hp(τ i ) t T j C j (min{l j, L i }) t τ i Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 15 / 25
16 Deciding Priority Levels Use Audsley s algorithm (assume N tasks) Let LO have l tasks and HI have h tasks Order all HI tasks by rate monotonic (1,h) Order all LO tasks by rate monotonic (1,l) Start at lowest priority (N) Is LO(l) (lowest priority task in LO) schedulable at priority level N? yes: l := l 1, and τ l is removed from LO If no, is HI(h) (lowest priority task in HI) schedulable at priority level N? yes h := h 1, and τ h is removed from HI If no, system unschedulable Repeat for N-1 etc. Max 2N 1 tests Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 16 / 25
17 Further Readings for References Alexandre Esper, Geoffrey Nelissen, Vincent Nélis, Eduardo Tovar: How realistic is the mixed-criticality real-time system model? RTNS 2015: Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie: Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems. J. ACM 62(2): 14 (2015) Georg von der Brggen, Kuan-Hsun Chen, Wen-Hung Huang and Jian-Jia Chen: Systems with Dynamic Real-Time Guarantees in Uncertain and Faulty Execution Environments, in RTSS 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 17 / 25
18 Uncertain and Faulty Execution Environments Uncertain / faulty behaviour imposed by physical environment Execution time of task instance enlarged, e.g. recovery process after fault detection Abnormal mode: Ci A > Ci N Assumption: faults happen rarely Using Ci A for scheduling analysis may be a huge over estimation But: only possibility if all tasks are safety critical Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 18 / 25
19 Aborting Tasks Reality: not all tasks are safety critical Deadline Miss (DM)) not that critical In theory and practical systems : abortion not so important tasks T soft in abnormal mode guarantees response time of more important tasks T hard Results of τ i T soft may still be useful, even if they are a bit late aborting may not be such a good idea Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 19 / 25
20 Problems τ i T hard must always meet the deadline We do not know when faults occur only one priority ordering Aborting only works if all tasks in T soft have lower priority then the tasks in T hard τ i T soft should still have good response time in normal mode τ i T soft should still meet there hard deadlines τ i T soft should have bounded tardiness in abnormal mode Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 20 / 25
21 Sufficient Test TDA for all tasks in normal mode (TDA) TDA for all τ i T hard in abnormal mode (TDA) τ i T soft with higher priority then the current task have to be considered Bounded tardiness τ i T soft U A sum 1 Observation: as Ci A > Ci N the schedulability test for τ i T hard only has to be checked in abnormal mode Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 21 / 25
22 RM is Not Optimal Rate Monotonic: Order according to the period τ 1 T soft = (2, 2 + ε, 6, 6) τ 2 T hard = (6, 8, 14, 14) Normal mode: τ 1 T soft = (2, 2 + ε, 6, 6) τ 2 T hard = (6, 8, 14, 14) Abnormal mode: DM Exchanging priority of τ 1 and τ 2 : τ 2 will meet its deadline U A = ε = 0.92 < 1 bounded tardiness for τ 1 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 22 / 25
23 SLPO is Not Optimal Service Level Priority Ordering: Order according to priority in abnormal mode τ 1 T hard = (6, 6 + ε, 12, 12) τ 2 T soft = (2, 2 + ε, 6, 6) τ 2 T soft = (2, 2 + ε, 6, 6) τ 1 T hard = (6, 6 + ε, 12, 12) Normal mode: DM Switching priority: Abnormal mode: τ 2 T soft = (2, 2 + ε, 6, 6) τ 1 T hard = (6, 6 + ε, 12, 12) Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 23 / 25
24 τ i T hard can be Ordered in DM Order τ 1 T hard τ 2 T soft τ 3 T hard τ 2 T soft τ 1 T hard τ 3 T hard τ 2 T soft τ 3 T hard τ 1 T hard Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 24 / 25
25 Acknowledgment The above slides are based on the slides provided from Prof. Rolf Ernst, Prof. Sanjoy Baruah, and Prof. Alan Burns. Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 25 / 25
Schedulability 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 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 informationMultiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling II: Global Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 28, June, 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 42 Global Scheduling We will only focus on identical
More informationMultiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling I: Partitioned Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 22/23, June, 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 47 Outline Introduction to Multiprocessor
More 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 informationGlobal mixed-criticality scheduling on multiprocessors
Global mixed-criticality scheduling on multiprocessors Haohan Li Sanjoy Baruah The University of North Carolina at Chapel Hill Abstract The scheduling of mixed-criticality implicit-deadline sporadic task
More 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 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 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 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 informationCriticality-Aware Partitioning for Multicore Mixed-Criticality Systems
Criticality-Aware Partitioning for Multicore Mixed-Criticality Systems Jian-Jun Han, Xin Tao, Dakai Zhu and Hakan Aydin School of Computer Science and Technology, Huazhong University of Science and Technology,
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 informationCEC 450 Real-Time Systems
CEC 450 Real-Time Systems Lecture 3 Real-Time Services Part 2 (Rate Monotonic Theory - Policy and Feasibility for RT Services) September 7, 2018 Sam Siewert Quick Review Service Utility RM Policy, Feasibility,
More 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 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 informationSCHEDULING MIXED-CRITICALITY REAL-TIME SYSTEMS
SCHEDULING MIXED-CRITICALITY REAL-TIME SYSTEMS Haohan Li A dissertation submitted to the faculty of the University of North Carolina at Chapel Hill in partial fulfillment of the requirements for the degree
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 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 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 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 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 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 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 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 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 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 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 informationSystem Model. Real-Time systems. Giuseppe Lipari. Scuola Superiore Sant Anna Pisa -Italy
Real-Time systems System Model Giuseppe Lipari Scuola Superiore Sant Anna Pisa -Italy Corso di Sistemi in tempo reale Laurea Specialistica in Ingegneria dell Informazione Università di Pisa p. 1/?? Task
More informationSchedulability Analysis for the Abort-and-Restart Model
Schedulability Analysis for the Abort-and-Restart Model Hing Choi Wong Doctor of Philosophy University of York Computer Science December 2014 Abstract In real-time systems, a schedulable task-set guarantees
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 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 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 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 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 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 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 informationdoktors der ingenieurwissenschaften
S C H E D U L I N G A L G O R I T H M S A N D T I M I N G A N A LY S I S F O R H A R D R E A L - T I M E S Y S T E M S Dissertation zur Erlangung des Grades eines doktors der ingenieurwissenschaften der
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 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 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 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 informationProbabilistic Schedulability Analysis for Fixed Priority Mixed Criticality Real-Time Systems
Probabilistic Schedulability Analysis for Fixed Priority Mixed Criticality Real-Time Systems Yasmina Abdeddaïm Université Paris-Est, LIGM, ESIEE Paris, France Dorin Maxim University of Lorraine, LORIA/INRIA,
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 informationImproved Priority Assignment for the Abort-and-Restart (AR) Model
Improved Priority Assignment for the Abort-and-Restart (AR) Model H.C. Wong and A. Burns Department of Computer Science, University of York, UK. February 1, 2013 Abstract This paper addresses the scheduling
More informationDVClub Europe Formal fault analysis for ISO fault metrics on real world designs. Jörg Große Product Manager Functional Safety November 2016
DVClub Europe Formal fault analysis for ISO 26262 fault metrics on real world designs Jörg Große Product Manager Functional Safety November 2016 Page 1 11/27/2016 Introduction Functional Safety The objective
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 informationCPU SCHEDULING RONG ZHENG
CPU SCHEDULING RONG ZHENG OVERVIEW Why scheduling? Non-preemptive vs Preemptive policies FCFS, SJF, Round robin, multilevel queues with feedback, guaranteed scheduling 2 SHORT-TERM, MID-TERM, LONG- TERM
More 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 informationRun and Be Safe: Mixed-Criticality Scheduling with Temporary Processor Speedup
Run and Be Safe: Mixed-Criticality Scheduling with Temporary Processor Speedup Pengcheng Huang, Pratyush Kumar, Georgia Giannopoulou, Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zurich,
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 informationThe preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems S. Baruah V. Bonifaci G. D Angelo H. Li A. Marchetti-Spaccamela S. van der Ster L. Stougie 1 Abstract
More informationTechnical Report. Errata for three papers ( ) on fixed-priority scheduling with self-suspensions
Technical Report Errata for three papers (2004-05) on fixed-priority scheduling with self-suspensions Konstantinos Bletsas* Neil Audsley Wen-Hung Huang Jian-Jia Chen Geoffrey Nelissen* *CISTER Research
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 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 informationLeveraging Transactional Memory for a Predictable Execution of Applications Composed of Hard Real-Time and Best-Effort Tasks
Leveraging Transactional Memory for a Predictable Execution of Applications Composed of Hard Real-Time and Best-Effort Tasks Stefan Metzlaff, Sebastian Weis, and Theo Ungerer Department of Computer Science,
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 informationPredictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems
Predictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems Sangchul Han and Minkyu Park School of Computer Science and Engineering, Seoul National University, Seoul,
More informationTime and Schedulability Analysis of Stateflow Models
Time and Schedulability Analysis of Stateflow Models Marco Di Natale Scuola Superiore S. Anna Haibo Zeng Mc Gill University Outline Context: MBD of Embedded Systems Relationship with PBD An Introduction
More 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 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 informationEDF Scheduling. Giuseppe Lipari May 11, Scuola Superiore Sant Anna Pisa
EDF Scheduling Giuseppe Lipari http://feanor.sssup.it/~lipari Scuola Superiore Sant Anna Pisa May 11, 2008 Outline 1 Dynamic priority 2 Basic analysis 3 FP vs EDF 4 Processor demand bound analysis Generalization
More informationAndrew Morton University of Waterloo Canada
EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo Canada Outline 1) Introduction and motivation 2) Review of EDF and feasibility analysis 3) Hardware accelerators and scheduling
More informationMany suspensions, many problems: a review of self-suspending tasks in real-time systems
Real-Time Systems (2019) 55:144 207 https://doi.org/10.1007/s11241-018-9316-9 Many suspensions, many problems: a review of self-suspending tasks in real-time systems Jian-Jia Chen 1 Geoffrey Nelissen 2
More informationPaper Presentation. Amo Guangmo Tong. University of Taxes at Dallas January 24, 2014
Paper Presentation Amo Guangmo Tong University of Taxes at Dallas gxt140030@utdallas.edu January 24, 2014 Amo Guangmo Tong (UTD) January 24, 2014 1 / 30 Overview 1 Tardiness Bounds under Global EDF Scheduling
More informationSchedule Table Generation for Time-Triggered Mixed Criticality Systems
Schedule Table Generation for Time-Triggered Mixed Criticality Systems Jens Theis and Gerhard Fohler Technische Universität Kaiserslautern, Germany Sanjoy Baruah The University of North Carolina, Chapel
More informationImproved Deadline Monotonic Scheduling With Dynamic and Intelligent Time Slice for Real-time Systems
Improved Deadline Monotonic Scheduling With Dynamic and Intelligent Time Slice for Real-time Systems H. S. Behera, Sushree Sangita Panda and Jana Chakraborty Department of Computer Science and Engineering,
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 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 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 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 informationarxiv: v3 [cs.ds] 1 May 2016
The triangle scheduling problem Christoph Dürr Zdeněk Hanzálek Christian Konrad Yasmina Seddik René Sitters Óscar C. Vásquez Gerhard Woeginger July 11, 2018 arxiv:1602.0365v3 [cs.ds] 1 May 2016 Abstract
More informationReal-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2
Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Lecture Outline Scheduling periodic tasks The rate monotonic algorithm Definition Non-optimality Time-demand analysis...!2
More informationSchedulability Analysis for the Abort-and-Restart (AR) Model
Schedulability Analysis for the Abort-and-Restart (AR) Model ABSTRACT H.C. Wong Real-Time Systems Research Group, Department of Computer Science, University of York, UK. hw638@york.ac.uk This paper addresses
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 informationSome ideas and open problems in real-time stochastic scheduling. Liliana CUCU, TRIO team, Nancy, France
Some ideas and open problems in real-time stochastic scheduling Liliana CUCU, TRIO team, Nancy, France Real-time systems Reactive systems Correct reaction Temporal constraints Gotha-- Liliana CUCU - 04/04/2008
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 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 informationDesign of Real-Time Software
Design of Real-Time Software Reference model Reinder J. Bril Technische Universiteit Eindhoven Department of Mathematics and Computer Science System Architecture and Networking Group P.O. Box 513, 5600
More informationModeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus
Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus Devesh B. Chokshi and Purandar Bhaduri Department of Computer Science and Engineering Indian Institute of Technology Guwahati,
More informationScheduling Stochastically-Executing Soft Real-Time Tasks: A Multiprocessor Approach Without Worst-Case Execution Times
Scheduling Stochastically-Executing Soft Real-Time Tasks: A Multiprocessor Approach Without Worst-Case Execution Times Alex F. Mills Department of Statistics and Operations Research University of North
More informationSegment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks
Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Junsung Kim, Björn Andersson, Dionisio de Niz, and Raj Rajkumar Carnegie Mellon University 2/31 Motion Planning on Self-driving Parallel
More informationWorst-Case Execution Time Analysis. LS 12, TU Dortmund
Worst-Case Execution Time Analysis Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 09/10, Jan., 2018 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 43 Most Essential Assumptions for Real-Time Systems Upper
More informationFinite Ready Queues As a Mean for Overload Reduction in Weakly-Hard Real-Time Systems
Finite Ready Queues As a Mean for Overload Reduction in Weakly-Hard Real-Time Systems Sophie Quinton, Leonie Ahrendts, Rolf Ernst To cite this version: Sophie Quinton, Leonie Ahrendts, Rolf Ernst. Finite
More informationComplexity of Uniprocessor Scheduling Analysis
Complexity of Uniprocessor Scheduling Analysis Pontus Ekberg and Wang Yi Abstract When designing a real-time system, a schedulability problem must be solved in order to show that it will meet all timing
More informationProbabilistic Analysis for Mixed Criticality Scheduling with SMC and AMC
Probabilistic Analysis for Mixed Criticality Scheduling with SMC and AMC Dorin Maxim 1, Robert I. Davis 1,2, Liliana Cucu-Grosjean 1, and Arvind Easwaran 3 1 INRIA, France 2 University of York, UK 3 Nanyang
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 informationUniprocessor real-time scheduling
Uniprocessor real-time scheduling Julien Forget Université Lille 1 Ecole d Été Temps Réel - 30 Août 2017 Julien Forget (Université Lille 1) Uniprocessor real-time scheduling ETR 2017 1 / 67 Overview At
More 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 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 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 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 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 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 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 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 informationNon-Work-Conserving Scheduling of Non-Preemptive Hard Real-Time Tasks Based on Fixed Priorities
Non-Work-Conserving Scheduling of Non-Preemptive Hard Real-Time Tasks Based on Fixed Priorities Mitra Nasri, Gerhard Fohler Chair of Real-time Systems, Technische Universität Kaiserslautern, Germany {nasri,
More informationSafety Instrumented Systems & Functional safety of safety-related systems. A substantial new opportunity for Pfannenberg Signaling products
Innovation Leadership Safety Instrumented Systems & Functional safety of safety-related systems A substantial new opportunity for Pfannenberg Signaling products P f a n n e n b e r g Group 1 Safe Signaling
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 informationOverview of Control System Design
Overview of Control System Design General Requirements 1. Safety. It is imperative that industrial plants operate safely so as to promote the well-being of people and equipment within the plant and in
More informationBursty-Interference Analysis Techniques for. Analyzing Complex Real-Time Task Models
Bursty-Interference Analysis Techniques for lemma 3 Analyzing Complex Real- Task Models Cong Liu Department of Computer Science The University of Texas at Dallas Abstract Due to the recent trend towards
More information