NET 424: REAL-TIME SYSTEMS (Practical Part)

Slides:



Advertisements
Similar presentations
Simulation of Feedback Scheduling Dan Henriksson, Anton Cervin and Karl-Erik Årzén Department of Automatic Control.
Advertisements

Washington WASHINGTON UNIVERSITY IN ST LOUIS Real-Time: Periodic Tasks Fred Kuhns Applied Research Laboratory Computer Science Washington University.
Real Time Scheduling.
Priority Inheritance and Priority Ceiling Protocols
CprE 458/558: Real-Time Systems
1 EE5900 Advanced Embedded System For Smart Infrastructure RMS and EDF Scheduling.
B. RAMAMURTHY 4/13/2015 cse321-fall2014 Realtime System Fundamentals : Scheduling and Priority-based scheduling Pag e 1.
CPE555A: Real-Time Embedded Systems
CSE 522 Real-Time Scheduling (4)
Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling - Session 10 - Peter Marwedel Heiko Falk TU Dortmund Informatik.
Chapter 5 – Fixed-Priority Servers Typical Real-Time systems are hybrids characterized by: periodic tasks that execute critical control activities aperiodic.
From HRT-HOOD to ADA95 Real-Time Systems Lecture 5 Copyright, 2001 © Adam Czajka.
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Exercise 2: Scheduling Real-Time Aperiodic Tasks.
Module 2 Priority Driven Scheduling of Periodic Task
Overview of Matchmaking and Scheduling (Mapping) Algorithm
Sporadic Server Scheduling in Linux Theory vs. Practice Mark Stanovich Theodore Baker Andy Wang.
Problem 11: Complex Hierarchical Scheduling Full Processor FP T3T2 T4T1 EDF T6T5 RM T10T9T8T7 EDFSPS DPS 10 Tasks - with jitter - with bursts - deadline.
Chapter 6 Dynamic Priority Servers
Periodic Task Scheduling
Fixed-Priority Servers
Deterministic Scheduling
Embedded Systems Exercise 3: Scheduling Real-Time Periodic and Mixed Task Sets 18. May 2005 Alexander Maxiaguine.
Chapter 4 – Periodic Task Scheduling In many real-time systems periodic tasks dominate the demand. Three classic periodic task scheduling algorithms: –
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.
6. Application mapping 6.1 Problem definition
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems RMS and EDF Schedulers.
Cheddar – Real Time Simulator Scheduling with task dependencies.
Special Class on Real-Time Systems
Real Time Operating Systems Schedulability - Part 2 Course originally developed by Maj Ron Smith 12/20/2015Dr Alain Beaulieu1.
Real-Time Scheduling CS 3204 – Operating Systems Lecture 13 10/3/2006 Shahrooz Feizabadi.
CSCI1600: Embedded and Real Time Software Lecture 24: Real Time Scheduling II Steven Reiss, Fall 2015.
Introduction to Embedded Systems Rabie A. Ramadan 5.
CSCI1600: Embedded and Real Time Software Lecture 23: Real Time Scheduling I Steven Reiss, Fall 2015.
Dynamic Priority Driven Scheduling of Periodic Task
Sandtids systemer 2.modul el. Henriks 1. forsøg m. Power Point.
Mok & friends. Resource partition for real- time systems (RTAS 2001)
Unit - I Real Time Operating System. Content : Operating System Concepts Real-Time Tasks Real-Time Systems Types of Real-Time Tasks Real-Time Operating.
Lecture 6: Real-Time Scheduling
ECE 720T5 Fall 2012 Cyber-Physical Systems
Scheduling and Resource Access Protocols: Basic Aspects
Unit OS9: Real-Time and Embedded Systems
Lecture 24: Process Scheduling Examples and for Real-time Systems
Houssam-Eddine Zahaf, Giuseppe Lipari, Luca Abeni RTNS’17
CprE 458/558: Real-Time Systems (G. Manimaran)
Scheduling in Packet Networks
Realtime Scheduling Algorithms
Chapter 6 Dynamic Priority Servers
CSCI1600: Embedded and Real Time Software
برنامج قواعد البيانات (مايكروسوفت أوفيس اكسس (Microsoft Office Access
NET 436 optical Network Tutorial Lecture #2
CSCI1600: Embedded and Real Time Software
RM 2 7 +RM 2 4 RM 7 3 +RM 1 6 RM 5 2 +RM 2 4 RM 1 3 +RM5 2.
CSCI1600: Embedded and Real Time Software
Limited-Preemption Scheduling of Sporadic Tasks Systems
Clock-driven Static scheduling
NET 424: REAL-TIME SYSTEMS (Practical Part)
Midterm Review CSE321 B.Ramamurthy 2/23/2019 B.Ramamurthy.
CSCI1600: Embedded and Real Time Software
Net 222: Communications and networks fundamentals (Practical Part)
NET 424: REAL-TIME SYSTEMS (Practical Part)
Midterm Review CSE321 B.Ramamurthy 4/4/2019 B.Ramamurthy.
NET 424: REAL-TIME SYSTEMS (Practical Part)
Midterm Review CSE321 B.Ramamurthy 4/8/2019 B.Ramamurthy.
NET 424: REAL-TIME SYSTEMS (Practical Part)
NET 424: REAL-TIME SYSTEMS (Practical Part)
Ch.7 Scheduling Aperiodic and Sporadic Jobs in Priority-Driven Systems
Mechanisms for Detecting and Handling Timing Errors
Ch 4. Periodic Task Scheduling
Real-Time Scheduling David Ferry CSCI 3500 – Operating Systems
Presentation transcript:

NET 424: REAL-TIME SYSTEMS (Practical Part) Networks and Communication Department Tutorial 8: on lecture 6

Question 1 A system contains two periodic tasks. They are (10,3) & (15,4). The task system also contains a sporadic server whose period is 8 and budget =2 The sporadic server is scheduled with the periodic tasks rate-monotonically. 1)Suppose that two aperiodic tasks A1 arrives at 2 and has execution time 2 and A2 arrives at 7 and has execution time 2. Find a feasible schedule. Networks and Communication Department

Answer Networks and Communication Department

Question 2 Assume the following periodic tasks: Task Period Deferrable server (7,1). Can we schedule the above tasks using RMS (rate monotonic scheduling)? Task Period Execution time 1 4 2 3 8 0.5 5 Networks and Communication Department

Answer Using : Networks and Communication Department

Answer Testing for T1: 𝟏 𝟒 + 𝟏 𝟕 + 𝟏 𝟒 =𝟎.𝟔𝟒𝟐 < U , So we can schedule T1 𝑼=𝒏 𝟐 𝟏 𝒏 − 𝟏 =𝟔 𝟐 𝟏 𝟔 −𝟏 = 𝟎.𝟕𝟑𝟔 ///n the total number of tasks including the server T2, T3 can also be scheduled because they have the same value for the period and the execution time . Testing for T4: 𝟏 𝟒 + 𝟎.𝟓 𝟖 + 𝟏 𝟕 + 𝟏 𝟖 =0.58 < U so both T4 and T5 can be scheduled Networks and Communication Department

Question 3 Execution time Period Task Assume the following periodic tasks: And a deferrable server (40,10). Can we schedule the above tasks using RMS (rate monotonic scheduling) or EDF (earliest deadline first)? Execution time Period Task 10 50 1 20 60 2 Networks and Communication Department

Answer Using : RMS EDF Networks and Communication Department

Answer 1) RMS Testing for T1: 𝟏𝟎 𝟓𝟎 + 𝟏𝟎 𝟒𝟎 + 𝟏𝟎 𝟓𝟎 =𝟎.𝟔𝟓 < U , So we can schedule T1 𝑼=𝒏 𝟐 𝟏 𝒏 − 𝟏 =𝟑 𝟐 𝟏 𝟑 −𝟏 = 𝟎.𝟕𝟕 ///n the total number of tasks including the server Testing for T2: 𝟏𝟎 𝟓𝟎 + 𝟐𝟎 𝟔𝟎 + 𝟏𝟎 𝟒𝟎 + 𝟏𝟎 𝟔𝟎 =0.95 > U T2 can NOT be scheduled. We can NOT schedule the tasks using RMS. Networks and Communication Department

Answer 2) EDF Calculate T1: 𝟏𝟎 𝟓𝟎 + 𝟐𝟎 𝟔𝟎 + 𝟏𝟎 𝟒𝟎 (𝟏+ 𝟒𝟎−𝟏𝟎 𝟓𝟎 )=0.93<1, So we can schedule T1 Calculate T2: 𝟐𝟎 𝟔𝟎 + 𝟏𝟎 𝟓𝟎 + 𝟏𝟎 𝟒𝟎 (𝟏+ 𝟒𝟎−𝟏𝟎 𝟔𝟎 )=0.905 <1, So we can schedule T2 The tasks can be scheduled using EDF. Networks and Communication Department

The End Any Questions ? Networks and Communication Department