NET 424: REAL-TIME SYSTEMS (Practical Part)

Slides:



Advertisements
Similar presentations
Real Time Scheduling.
Advertisements

Chapter 7 - Resource Access Protocols (Critical Sections) Protocols: No Preemptions During Critical Sections Once a job enters a critical section, it cannot.
Priority Inheritance and Priority Ceiling Protocols
Washington WASHINGTON UNIVERSITY IN ST LOUIS Resource and Resource Access Control Fred Kuhns Applied Research Laboratory Computer Science and Engineering.
Introduction to Embedded Systems Resource Management - III Lecture 19.
Priority INHERITANCE PROTOCOLS
CprE 458/558: Real-Time Systems
Copyright © 2000, Daniel W. Lewis. All Rights Reserved. CHAPTER 8 SCHEDULING.
7.2 Polynomial Functions and Their Graphs
1 EE5900 Advanced Embedded System For Smart Infrastructure RMS and EDF Scheduling.
LUI SHA,RAGUNATHAN RAJKUMAR,JOHN P.LEHOCZKY IEEE TRANSACTIONS ON COMPUTERS, VOL. 39, NO. 9, SEPTEMBER 1990 Repesent : Shu Wei Ho.
0 Synchronization Problem Resource sharing –Requires mutual exclusion –Critical section A code section that should be executed mutually exclusively by.
CS5270 Lecture 31 Uppaal, and Scheduling, and Resource Access Protocols CS 5270 Lecture 3.
Resource Access Protocols
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Resource Access Control Protocols.
Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling - Session 10 - Peter Marwedel Heiko Falk TU Dortmund Informatik.
From HRT-HOOD to ADA95 Real-Time Systems Lecture 5 Copyright, 2001 © Adam Czajka.
Lecture 7: 9/17/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Introduction to Operating Systems – Windows process and thread management In this lecture we will cover Threads and processes in Windows Thread priority.
Cs238 CPU Scheduling Dr. Alan R. Davis. CPU Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU.
Resource Access Control (Part I) The Mars Pathfinder Incident Resource Model Priority Inversion.
Reinder J. Bril, TU/e Informatica, System Architecture and Networking 1 Construction of time lines for FPPS Reinder J. Bril Real-Time Architectures.
Section 2.6 Question 1. Section 2.6 Answer 1 Section 2.6 Question 2.
By Group: Ghassan Abdo Rayyashi Anas to’meh Supervised by Dr. Lo’ai Tawalbeh.
MicroC/OS-II Embedded Systems Design and Implementation.
Chapter 4 – Periodic Task Scheduling In many real-time systems periodic tasks dominate the demand. Three classic periodic task scheduling algorithms: –
Choose the right picture
A processor is a person, machine, computer, or robot etc., which works on a task. To solve a scheduling problem typically the tasks are scheduled to minimize.
Operating System Concepts and Techniques Lecture 5 Scheduling-1 M. Naghibzadeh Reference M. Naghibzadeh, Operating System Concepts and Techniques, First.
Chapter 101 Multiprocessor and Real- Time Scheduling Chapter 10.
Real Time Operating Systems Schedulability - Part 3 Course originally developed by Maj Ron Smith 10/24/2015Dr Alain Beaulieu1.
Real Time Scheduling Telvis Calhoun CSc Outline Introduction Real-Time Scheduling Overview Tasks, Jobs and Schedules Rate/Deadline Monotonic Deferrable.
C o n f i d e n t i a l 1 Course: BCA Semester: III Subject Code : BC 0042 Subject Name: Operating Systems Unit number : 1 Unit Title: Overview of Operating.
Copyright ©: Nahrstedt, Angrave, Abdelzaher1 Scheduling II: priority scheduling.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 March 03, 2005 Session 15.
Scis.regis.edu ● CS-434: Object-Oriented Programming Using Java Week 8 Dr. Jesús Borrego Adjunct Faculty Regis University 1.
CSCI1600: Embedded and Real Time Software Lecture 24: Real Time Scheduling II Steven Reiss, Fall 2015.
Introduction to Embedded Systems Rabie A. Ramadan 5.
SATMathVideos.Net A set S consists of all multiples of 4. Which of the following sets are contained within set S? A) S2 only B) S4 only C) S2 and S4 D)
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
1.  System Characteristics  Features of Real-Time Systems  Implementing Real-Time Operating Systems  Real-Time CPU Scheduling  An Example: VxWorks5.x.
Undergraduate course on Real-time Systems Linköping University TDDD07 Real-time Systems Lecture 2: Scheduling II Simin Nadjm-Tehrani Real-time Systems.
Course Description/001 Objectives in This Course 1. Understanding components in computer networks - What are the major network hardware components? - What.
Topics Covered What is Real Time Operating System (RTOS)
Scheduling and Resource Access Protocols: Basic Aspects
Operating Systems (CS 340 D)
Ying Zhang&Krishnendu Chakrabarty Presenter Kasım Sert
EEE 6494 Embedded Systems Design
IS310 Hardware & Network Infrastructure Ronny L
Lecture 4 Schedulability and Tasks
CSC 336 Data Communications and Networking
Rate Monotonic Analysis For Real-Time Scheduling A presentation for
Chapter 2: The Linux System Part 3
NET 436 optical Network Tutorial Lecture #2
TDC 311 Process Scheduling.
CSCI1600: Embedded and Real Time Software
Limited-Preemption Scheduling of Sporadic Tasks Systems
NET 424: REAL-TIME SYSTEMS (Practical Part)
CSCI1600: Embedded and Real Time Software
Resource access control -- example
NET 424: REAL-TIME SYSTEMS (Practical Part)
Net 222: Communications and networks fundamentals (Practical Part)
Standards Chapter 7.
NET 424: REAL-TIME SYSTEMS (Practical Part)
Modifying Theorem 2 Theorem 4 (The synchronous completion time theorem) In the above theorem, a task i will meet its completion deadline Di if it satisfies.
List Processing (SOL: DM.10)
NET 424: REAL-TIME SYSTEMS (Practical Part)
NET 424: REAL-TIME SYSTEMS (Practical Part)
The End Of The Line For Static Cyclic Scheduling?
CGS 3763 Operating Systems Concepts Spring 2013
Presentation transcript:

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

Question 1 Consider the Priority Ceiling Protocol. Using this protocol, give a picture describing a run of three tasks on one processor: _ Task 1 has the highest priority. Task 1 arrives at time t=6. Task 1 consists of normal computation for 2 time units, followed by critical section 1 for 2 time units, followed by normal computation for 1 time unit. _ Task 2 has lower priority than Task 1. Task 2 arrives at time t=2. Task 2 consists of normal computation for 1 time unit, followed by critical section 2 for 3 time units, followed by normal computation for 1 time unit, followed by critical section 3 for 1 time unit, followed by normal computation for 1 time unit. . Networks and Communication Department

Question 1 _ Task 3 has the lowest priority. Task 3 arrives at time t=0. Task 3 consists of normal computation for 1 time unit, followed by critical section 3 for 2 time units, followed by normal computation for 1 time unit. Your picture should depict which task is executed (and the type of computation: either normal or the critical section the task is in) in the processor at which point in time, covering the interval from time t=0 until all work is done. You should also explicitly give any changes in the priority of the Tasks Networks and Communication Department

Answer R1 R1 T1 R2 R2 R2 R3 T2 R3 R3 T3 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Networks and Communication Department

Question 2 Basic inheritance protocol Ri ei Resource requirements   Ri ei Resource requirements J1 7 3 [R1; 1] J2 5 3 [R2; 1] J3 4 2 J4 2 6 [R1; 4 [R2; 1.5]] J5 0 6 [R2; 4] T=1  J5  R2 T=3  J4  R1 T=11 J4  R2 T=11 J1 R1 T= 13 J2 R2 Networks and Communication Department

Answer R1 J1 R2 J2 J3 R1 R1 R1 R1 R2 J4 R2 R2 R2 R2 J5 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Networks and Communication Department

The End Any Questions ? Networks and Communication Department