Resource Augmentation for Fault-Tolerance Feasibility of Real-time Tasks under Error Bursts Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat and.

Slides:



Advertisements
Similar presentations
1 EE5900 Advanced Embedded System For Smart Infrastructure RMS and EDF Scheduling.
Advertisements

CS5270 Lecture 31 Uppaal, and Scheduling, and Resource Access Protocols CS 5270 Lecture 3.
Harini Ramaprasad, Frank Mueller North Carolina State University Center for Embedded Systems Research Tightening the Bounds on Feasible Preemption Points.
THE UNIVERSITY of TEHRAN Mitra Nasri Sanjoy Baruah Gerhard Fohler Mehdi Kargahi October 2014.
From HRT-HOOD to ADA95 Real-Time Systems Lecture 5 Copyright, 2001 © Adam Czajka.
Real-Time Scheduling CIS700 Insup Lee October 3, 2005 CIS 700.
Tasks Periodic The period is the amount of time between each iteration of a regularly repeated task Time driven The task is automatically activated by.
CPU SCHEDULING RONG ZHENG. OVERVIEW Why scheduling? Non-preemptive vs Preemptive policies FCFS, SJF, Round robin, multilevel queues with feedback, guaranteed.
Soft Real-Time Semi-Partitioned Scheduling with Restricted Migrations on Uniform Heterogeneous Multiprocessors Kecheng Yang James H. Anderson Dept. of.
Problem 11: Complex Hierarchical Scheduling Full Processor FP T3T2 T4T1 EDF T6T5 RM T10T9T8T7 EDFSPS DPS 10 Tasks - with jitter - with bursts - deadline.
Towards Feasibility Region Calculus: An End-to-end Schedulability Analysis of Real- Time Multistage Execution William Hawkins and Tarek Abdelzaher Presented.
Preemptive Behavior Analysis and Improvement of Priority Scheduling Algorithms Xiaoying Wang Northeastern University China.
1 of 14 1 Fault-Tolerant Embedded Systems: Scheduling and Optimization Viacheslav Izosimov, Petru Eles, Zebo Peng Embedded Systems Lab (ESLAB) Linköping.
Present by Chen, Ting-Wei Adaptive Task Checkpointing and Replication: Toward Efficient Fault-Tolerant Grids Maria Chtepen, Filip H.A. Claeys, Bart Dhoedt,
System-Wide Energy Minimization for Real-Time Tasks: Lower Bound and Approximation Xiliang Zhong and Cheng-Zhong Xu Dept. of Electrical & Computer Engg.
1 of 14 1 Scheduling and Optimization of Fault- Tolerant Embedded Systems Viacheslav Izosimov Embedded Systems Lab (ESLAB) Linköping University, Sweden.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Imprecise Computations.
Misconceptions About Real-time Computing : A Serious Problem for Next-generation Systems J. A. Stankovic, Misconceptions about Real-Time Computing: A Serious.
Real-Time Operating System Chapter – 8 Embedded System: An integrated approach.
Technische Universität Dortmund Classical scheduling algorithms for periodic systems Peter Marwedel TU Dortmund, Informatik 12 Germany 2007/12/14.
REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Towards a Contract-based Fault-tolerant Scheduling Framework for Distributed Real-time Systems Abhilash Thekkilakattil, Huseyin Aysan and Sasikumar Punnekkat.
Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat Mälardalen Real-time Research Center, Mälardalen University Västerås, Sweden Preemption Control.
Page 110/9/2015 CSE 40373/60373: Multimedia Systems So far…  RMS - task with highest rate has highest priority  EDF – earliest deadline first  Tasks.
Probabilistic Preemption Control using Frequency Scaling for Sporadic Real-time Tasks Abhilash Thekkilakattil, Radu Dobrin and Sasikumar Punnekkat.
Quantifying the Sub-optimality of Non-preemptive Real-time Scheduling Abhilash Thekkilakattil, Radu Dobrin and Sasikumar Punnekkat.
Real-Time Scheduling CS4730 Fall 2010 Dr. José M. Garrido Department of Computer Science and Information Systems Kennesaw State University.
1 Reducing Queue Lock Pessimism in Multiprocessor Schedulability Analysis Yang Chang, Robert Davis and Andy Wellings Real-time Systems Research Group University.
Scheduling policies for real- time embedded systems.
DESIGNING VM SCHEDULERS FOR EMBEDDED REAL-TIME APPLICATIONS Alejandro Masrur, Thomas Pfeuffer, Martin Geier, Sebastian Drössler and Samarjit Chakraborty.
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements I-Hong Hou and P.R. Kumar 1.
Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat Mälardalen Real-time Research Center, Mälardalen University Västerås, Sweden Towards Preemption.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 31 – Multimedia OS (Part 1) Klara Nahrstedt Spring 2011.
Real-Time Scheduling CS4730 Fall 2010 Dr. José M. Garrido Department of Computer Science and Information Systems Kennesaw State University.
Real-Time Scheduling CS 3204 – Operating Systems Lecture 20 3/3/2006 Shahrooz Feizabadi.
The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-time Tasks Abhilash Thekkilakattil, Sanjoy Baruah, Radu Dobrin and Sasikumar.
REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
CS244-Introduction to Embedded Systems and Ubiquitous Computing Instructor: Eli Bozorgzadeh Computer Science Department UC Irvine Winter 2010.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems RMS and EDF Schedulers.
Resource Augmentation for Performance Guarantees in Embedded Real-time Systems Abhilash Thekkilakattil Licentiate Thesis Presentation Västerås, November.
Fault Tolerant Scheduling of Mixed Criticality Real-Time Tasks under Error Bursts Abhilash Thekkilakattil, Radu Dobrin and Sasikumar Punnekkat.
Special Class on Real-Time Systems
CSE 522 Real-Time Scheduling (2)
Real-Time Scheduling CS 3204 – Operating Systems Lecture 13 10/3/2006 Shahrooz Feizabadi.
Mixed Criticality Systems: Beyond Transient Faults Abhilash Thekkilakattil, Alan Burns, Radu Dobrin and Sasikumar Punnekkat.
1 Real-Time Scheduling. 2Today Operating System task scheduling –Traditional (non-real-time) scheduling –Real-time scheduling.
Common Approaches to Real-Time Scheduling Clock-driven (time-driven) schedulers Priority-driven schedulers Examples of priority driven schedulers Effective.
Multiprocessor Fixed Priority Scheduling with Limited Preemptions Abhilash Thekkilakattil, Rob Davis, Radu Dobrin, Sasikumar Punnekkat and Marko Bertogna.
CSCI1600: Embedded and Real Time Software Lecture 23: Real Time Scheduling I Steven Reiss, Fall 2015.
Classical scheduling algorithms for periodic systems Peter Marwedel TU Dortmund, Informatik 12 Germany 2012 年 12 月 19 日 These slides use Microsoft clip.
Introduction to Real-Time Systems
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults Ching-Chih Han, Kang G. Shin, and Jian Wu.
Mok & friends. Resource partition for real- time systems (RTAS 2001)
Undergraduate course on Real-time Systems Linköping University TDDD07 Real-time Systems Lecture 2: Scheduling II Simin Nadjm-Tehrani Real-time Systems.
Introductory Seminar on Research CIS5935 Fall 2008 Ted Baker.
Determining Optimal Processor Speeds for Periodic Real-Time Tasks with Different Power Characteristics H. Aydın, R. Melhem, D. Mossé, P.M. Alvarez University.
Unit - I Real Time Operating System. Content : Operating System Concepts Real-Time Tasks Real-Time Systems Types of Real-Time Tasks Real-Time Operating.
CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 32 – Multimedia OS Klara Nahrstedt Spring 2010.
Fault-Tolerant Rate- Monotonic Scheduling Sunondo Ghosh, Rami Melhem, Daniel Mosse and Joydeep Sen Sarma.
Lecture 6: Real-Time Scheduling
Embedded System Scheduling
Reducing the Number of Preemptions in Real-Time Systems Scheduling by CPU Frequency Scaling Abhilash Thekkilakattil, Anju S Pillai, Radu Dobrin, Sasikumar.
Wayne Wolf Dept. of EE Princeton University
EEE 6494 Embedded Systems Design
Lecture 24: Process Scheduling Examples and for Real-time Systems
CprE 458/558: Real-Time Systems
Realtime Scheduling Algorithms
Elastic Task Model For Adaptive Rate Control
Dynamic Voltage Scaling
Processes and operating systems
Presentation transcript:

Resource Augmentation for Fault-Tolerance Feasibility of Real-time Tasks under Error Bursts Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat and Huseyin Aysan

Real-time tasks Dependable Hard Real-time Systems web images Fault tolerance requirements Timing characteristics of the physical components Event occurrences

Fault Tolerance in Real-time Systems Nature of errors -Normally continuous events e.g., a vehicle passing through electromagnetic fields -Occur continuously over a period of time: error bursts Challenging to handle in classical FT-feasibility analysis -Need to map continuous events into singleton events Temporal redundancy for transient faults faults/errors as singleton events error Burst classical FT-feasibility analysis

Why FT-feasibility? FT-feasibility analysis simplifies system design process: ●Can check for the existence of a schedule even before finding the scheduler ●If a schedule exists: ●Use optimal scheduling policies e.g., EDF ●If a schedule does not exist: ●Adjust task attributes ●Use a faster processor Use of a faster processor ●Can we find upper-bounds? ●Will the search for the optimal speed eventually terminate? ●Is the speed-up required affordable?

Problem Description Questions: ●How can we perform an FT-feasibility analysis for a given set of temporally redundant real-time tasks under a specified error burst length? ●If the real-time task set is not found to be FT-feasible, what is the lowest processor speed that guarantees its FT-feasibility under the error burst?

Problem Description Questions: ●How can we perform an FT-feasibility analysis for a given set of temporally redundant real-time tasks under a specified error burst length? ●If the real-time task set is not found to be FT-feasible, what is the lowest processor speed that guarantees its FT-feasibility under the error burst?

Definitions t T length worst case error overhead (E t ) ε ε Worst Case Temporal Wastage (W err (t)) = maximum wasted execution time ∑

Assumptions ● Objective: Find the Worst Case Temporal Wastage at time t ● Strategy: we assume that there are no deadline misses under the error burst and derive the sufficient condition for this to be true t’t’ t abs. deadline of τ i Error detection τiτi

Case 1 t’t’ t dkdk W err (d k ) = W err (t) W err (d k ) = W err (d (k-1) ) Under EDF, the tasks released in the interval [t’,t] having a deadline greater than t are not hit by the error burst τjτj τiτi Worst Case Temporal Wastage at the absolute deadline of a job that is not hit by the error burst abs. deadline of τ i t < d (k-1) ≤ d k

Case 2 τiτi τjτj τkτk t’t’t τiτi τjτj τkτk t’t’t τiτi τjτj τkτk t’t’t Worst Case Temporal Wastage at t when the error burst hits only a single job scenario a: W err (t)=2(C k – ε) scenario b: W err (t)= 2(C j – ε) scenario c: W err (t)= 2(C i – ε)

ε Case 3 ε ε ε τiτi τjτj τkτk τlτl t’t’ t ε T length Worst Case Temporal Wastage at t when the error burst hits more than one job (C l – ε) (C k – ε) (C j – ε) (C i – ε) W err (t) =2(C i – ε)+ ∑ (C k – ε), D k ≤ D i

Worst Case Temporal Wastage: General Case W err (t) = Max Case 1 : WCTW at the previous absolute deadline If τ i is not hit by the error burst Case 2 : max{2(C k – ε)}, D k ≤ D i When the error burst hits only a single job Case 3 : 2(C i – ε) + ∑ (C k – ε), D k ≤ D i When the error burst hits more than one job t is the absolute deadline of a task τ i

FT-Feasibility: A Sufficient Condition DBF(t)T length t EtEt E t + DBF(t) ≤ t E t = W err (t) + T length

Problem Description Questions: ●How can we perform an FT-feasibility analysis for a given set of temporally redundant real-time tasks under a specified error burst length? ●If the real-time task set is not found to be FT-feasible, what is the lowest processor speed that guarantees its FT-feasibility under the error burst?

Resource Augmentation t DBF(t) deadline miss T length T length + W err (t) + DBF(t) ≤ t [W err (t) =x+y] If, T length + W err (t) + DBF(t) > t then, speed-up by S, T length + W err (t) /S+ DBF(t)/S ≤ t Hence, S ≤ (DBF(t)+ W err (t) )/ (t - T length ) =>S = max{(DBF(t)+ W err (t) )/ (t -T length )} S = max { (DBF(t) + W err (t) )/ (t - T length )} Is S bounded ? X + Y’ = W err (t) /S S ≤ 6 [y ≥ 2 => T length ≤ D min /2] X + Y = W err (t) DBF(t)DBF(t)/S Put W err (t) = 2DBF(t) and DBF(t) = t S ≤ 3t/(t- T length ) S ≤ 3y/(y-1) y=t/ T length

Conclusions ● Fault tolerance feasibility analysis of real-time tasks ●A sufficient condition for FT-feasibility ● Resource augmentation bounds for FT-feasibility ●Speed-up ≤ 6 if T length ≤ shortest deadline/2 ● Future work: ●More severe error models ●Utilization based test for FT-feasibility

Thank you ! Questions ?