Using SCHED DEADLINE in Linux. Luca Abeni
|
|
- Archibald Campbell
- 6 years ago
- Views:
Transcription
1 in Linux Luca Abeni
2 Using Fixed Priorities in Linux SCHED FIFO and SCHED RR use fixed priorities They can be used for real-time tasks, to implement RM and DM Real-time tasks have priority over non real-time (SCHED OTHER) tasks The difference between the two policies is visible when more tasks have the same priority In real-time applications, try to avoid multiple tasks with the same priority
3 Setting the Scheduling Policy int sched_get_priority_max(int policy); int sched_get_priority_min(int policy); int sched_setscheduler(pid_t pid, int policy, const struct sched_param *param); int sched_setparam(pid_t pid, const struct sched_param *param); Ifpid == 0, then the parameters of the running task are changed The only meaningful field ofstruct sched param issched priority See the code: rt utils.c and the examples: priority1.c andpriority2.c
4 Problems with Real-Time Priorities In general, regular (SCHED OTHER) tasks are scheduled in background respect to real-time ones Real-time tasks can / starve other applications Example: the following task scheduled at high priority can make a CPU / core unusable 1 void bad_bad_task() 2 { 3 while(1); 4 } Real-time computation have to be limited (use real-time priorities only when really needed!) Using real-time priorities requires root privileges (or part of them!)
5 Real-Time Throttling A bad rt task can make a CPU / core unusable......linux provides the real-time throttling mechanism to address this problem By limiting the execution time of real-time tasks per period. # echo -1 > /proc/sys/kernel/sched rt runtime us Very useful idea, but something more theoretically founded might be needed...
6 EDF in the Linux kernel EDF assigns dynamic priorities based on absolute deadlines So, a more advanced API for the scheduler is needed... Assign relative deadlines D i to the tasks... A runtime and a period are also needed Moreover, d i,j = r i,j +D i......however, how can the scheduler know r i,j? The scheduler is not aware of jobs...
7 Tasks and Jobs... EDF need to know when a job starts / finishes Applications must be modified to signal the beginning / end of a job (some kind of startjob() /endjob() system call)......or the scheduler can assume that a new job arrives each time a task wakes up! Or, some other algorithm can be used to assign dynamic scheduling deadlines to tasks
8 ... And Scheduling Deadlines! The scheduler does EDF on scheduling deadlines Scheduling deadline d s i: assigned by the kernel But the task cares about its absolute deadlines If the scheduling deadline d s i matches the absolute deadline d i,j of a job, then the scheduler can respect d i,j!!!
9 CBS: The Basic Idea Constant Bandwidth Server (CBS): algorithm to assign a dynamic scheduling deadline d s i to a task τ i Based on the Resource Reservation paradigm Task τ i is periodically reserved a maximum runtime Q i every reservation period P i Temporal isolation between tasks The worst case finishing time for a task does not depend on the other tasks......because the task is guaranteed to receive its reserved time Solves the issue with bad tasks trying to consume too much execution time
10 CBS: Some More Details Based on CPU reservations (Q i,p i ) If τ i tries to execute for more than Q i every P i, the algorithm decreases its priority, or throttles it τ i has the same CPU utilisation of a task with WCET Q i and period P i Q i /P i : fraction of CPU time reserved to τ i EDF on the scheduling deadlines τ i is guaranteed to receive Q i time units every P i if jq j /P j 1!!!
11 SCHED DEADLINE NewSCHED DEADLINE scheduling policy Foreground respect to all of the other policies Uses the CBS to assign scheduling deadline to SCHED DEADLINE tasks Assign a (maximum) runtime Q i and a (reservation) period P i to every SCHED DEADLINE task Additional parameter: relative deadline D i The check if the current scheduling deadline can be used rule is used at task wake-up...use EDF (based on scheduling deadlines) to schedule them
12 Linux provides a (non standard) API for using SCHED DEADLINE, but......how to dimension the scheduling parameters? (Maximum) runtime Q i (Reservation) period P i Obviously, it must be Q i M i P i The kernel can do this admission control Better to use a limit smaller than M (so that other tasks are not starved!) Setting the policy might fail if admission control fails
13 Setting the Scheduling Policy Nosched setsched() new syscalls (and data structures added to be extensible) int sched_setattr(pid_t pid, const struct sched_attr *attr, unsigned int flags); int sched_getattr(pid_t pid, struct sched_attr *attr, unsigned int size, unsigned int flags); struct sched_attr { u32 size; u32 sched_policy; u64 sched_flags; /* SCHED_NORMAL, SCHED_BATCH */ s32 sched_nice; /* SCHED_FIFO, SCHED_RR */ u32 sched_priority; /* SCHED_DEADLINE */ u64 sched_runtime; u64 sched_deadline; u64 sched_period; };
14 Usingsched setattr() pid: as forsched setscheduler() flags: currently unused (for future extensions!) attr: scheduling parameters for the task size: must be set tosizeof(struct sched attr) sched policy: set to SCHED DEADLINE! sched runtime: Q sched deadline: D sched period: P sched flags: will see later (set to 0 for now)
15 Example Typical use of SCHED DEADLINE in a program #include <sched.h>... struct sched_attr attr; attr.size = sizeof(struct attr); attr.sched_policy = SCHED_DEADLINE; attr.sched_runtime = ; attr.sched_period = ; attr.sched_deadline = attr.sched_period;... if (sched_setattr(gettid(), &attr, 0)) perror("sched_setattr()");... sched runtime, sched period and sched deadline defined in ns Try the code: resource reservation.c
16 libdl So, can we use SCHED DEADLINE in our user programs? sched setattr() & friends are in the kernel since But the user-space side of things is still missing in many Linux distributions No support in glibc, no definition ofstruct sched attr, etc... Solution: small user-space library providing the sched *attr() system calls and related data structures libdl, released by Juri Lelli under GPL
SCHED DEADLINE: a real-time CPU scheduler for Linux
: a real-time CPU scheduler for Luca Abeni luca.abeni@santannapisa.it TuToR 2017 Luca Abeni 1 / 33 Scheduling Real-Time Tasks c j f j c j+1 r d j j r f j+1 d j+1 j+1 Consider a set ofn real-time tasks
More informationT. Cucinotta Real-Time Systems Lab (ReTiS) Scuola Superiore Sant'Anna Pisa Italy 1. Real-Time Scheduling on Linux and SCHED_DEADLINE
T. Cucinotta Real-Time Systems Lab (ReTiS) Scuola Superiore Sant'Anna Pisa Italy 1 Real-Time Scheduling on Linux and SCHED_DEADLINE Linux CPU Schedulers Scheduling classes and policies Classes listed in
More informationImplementing Task Schedulers (1) Real-Time and Embedded Systems (M) Lecture 10
Implementing Task Schedulers (1) Real-Time and Embedded Systems (M) Lecture 10 Lecture Outline Implementing priority scheduling: Tasks, threads and queues Building a priority scheduler Fixed priority scheduling
More informationPriority-driven Scheduling of Periodic Tasks (2) Advanced Operating Systems (M) Lecture 5
Priority-driven Scheduling of Periodic Tasks (2) Advanced Operating Systems (M) Lecture 5 Lecture Outline Schedulability tests for fixed-priority systems Conditions for optimality and schedulability General
More informationSFO The Linux Kernel Scheduler. Viresh Kumar (PMWG)
SFO17-421 The Linux Kernel Scheduler Viresh Kumar (PMWG) Topics CPU Scheduler The O(1) scheduler Current scheduler design Scheduling classes schedule() Scheduling classes and policies Sched class: STOP
More informationCPU Scheduling (Part II)
CPU Scheduling (Part II) Amir H. Payberah amir@sics.se Amirkabir University of Technology (Tehran Polytechnic) Amir H. Payberah (Tehran Polytechnic) CPU Scheduling 1393/7/28 1 / 58 Motivation Amir H. Payberah
More informationReservation-Based Scheduling for IRQ Threads
Reservation-Based Scheduling for IRQ Threads Luca Abeni, Nicola Manica, Luigi Palopoli luca.abeni@unitn.it, nicola.manica@gmail.com, palopoli@dit.unitn.it University of Trento, Trento - Italy Reservation-Based
More informationLinux Task Scheduling
Linux Task Scheduling Hyunmin Yoon (hmyoon@rtcc.hanyang.ac.kr) 2 This document is based-on linux 4.15.6 version (released at 2018.02.26) 2 3 Task Scheduling SCHEDULING CLASS 3 4 Scheduling Class Since
More informationOperating system concepts. Task scheduling
Operating system concepts Task scheduling Task scheduling (thread scheduling) Target of scheduling are ready tasks ACTIVE TASK BLOCKED TASKS PASSIVE TASKS READY TASKS Active task currently running on processor
More informationRecap. Run to completion in order of arrival Pros: simple, low overhead, good for batch jobs Cons: short jobs can stuck behind the long ones
Recap First-Come, First-Served (FCFS) Run to completion in order of arrival Pros: simple, low overhead, good for batch jobs Cons: short jobs can stuck behind the long ones Round-Robin (RR) FCFS with preemption.
More informationAdvanced Operating Systems
https://www.pf.is.s.u-tokyo.ac.jp/classes Advanced Operating Systems #6 Hiroyuki Chishiro Project Lecturer Department of Computer Science Graduate School of Information Science and Technology
More informationDeadline Miss Detection with SCHED_DEADLINE
Deadline Miss Detection with SCHED_DEADLINE Yoshitake Kobayashi Advanced Software Technology Group Corporate Software Engineering Center TOSHIBA CORPORATION Copyright 2013, Toshiba Corporation. Resources
More informationSCHED_DEADLINE How to use it
TeCIP Insiue, Scuola Superiore San'Anna Area della Ricerca CNR, Via G. Moruzzi 1 56127 Pisa, Ialy SCHED_DEADLINE How o use i Juri Lelli Reis Lab SSSUP Pisa (Ialy), June 26h 2014 Basics and saus Ouline
More information10 th AUTOSAR Open Conference
10 th AUTOSAR Open Conference Yuchen Zhou, Thomas E Fuhrman, Prathap Venugopal General Motors Scheduling Techniques for Automated Driving Systems using the AUTOSAR Adaptive Platform AUTOSAR Nov-2017 Agenda
More informationLinux Scheduler. Minsoo Ryu. Department of Computer Science and Engineering. Hanyang University. Real-Time Computing and Communications Lab.
Linux Scheduler Minsoo Ryu Department of Computer Science and Engineering 2 1 Introduction to Linux Scheduler Page X 2 Completely Fair Scheduler (CFS) Page X 3 CFS Implementation in the Kernel Page X 4
More informationOperating Systems and Networks Assignment 9
Spring Term 01 Operating Systems and Networks Assignment 9 Assigned on: rd May 01 Due by: 10th May 01 1 General Operating Systems Questions a) What is the purpose of having a kernel? Answer: A kernel is
More informationLinux process scheduling. David Morgan
Linux process scheduling David Morgan General neediness categories realtime processes whenever they demand attention, need it immediately other processes interactive care about responsiveness demand no
More informationSCHED_DEADLINE (what it does and doesn't do, yet).
SCHED_DEADLINE (wha i does and doesn' do, ye). Juri Lelli Deparmen of Auomaic Conrol Lund Universiy (Sweden), May 5h 2014 TeCIP Insiue, Scuola Superiore San'Anna Area della Ricerca CNR, Via G. Moruzzi
More informationComparison of soft real-time CPU scheduling in Linux kernel 2.6 series with Solaris 10
Comparison of soft real-time CPU scheduling in Linux kernel 2.6 series with Solaris 10 Kristoffer Eriksson Philip Frising Department of Computer and Information Science Linköping University 1(15) 1. About
More informationProgramming RT systems with pthreads
Programming RT systems with pthreads Giuseppe Lipari http://feanor.sssup.it/~lipari Scuola Superiore Sant Anna Pisa December 1, 2011 Outline 1 Timing utilities 2 Periodic threads 3 Scheduler selection
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne Histogram of CPU-burst Times 6.2 Silberschatz, Galvin and Gagne Alternating Sequence of CPU And I/O Bursts 6.3 Silberschatz, Galvin and Gagne CPU
More information/sleeper Work: VOL CS: IVOL CS: /CPU Work: VOL CS: IVOL CS: /IO Work: VOL CS: IVOL CS: Each of the
- 1-1 CS 460 Scheduling Lab 2 3 Shutdown VB and change the System to use 2 CPUs. 4 5 Open terminator! 6 7 wget http://zeus.cs.pacificu.edu/chadd/cs460s18/schedlab.tar.gz 8 9 tar xzf SchedLab.tar.gz 10
More informationClass average is Undergraduates are performing better. Working with low-level microcontroller timers
Student feedback Low grades of the midterm exam Class average is 86.16 Undergraduates are performing better Cheat sheet on the final exam? You will be allowed to bring one page of cheat sheet to the final
More informationReal Time Operating Systems and Middleware
Real Time Operating Systems and Middleware Introduction to Real-Time Systems Luca Abeni abeni@disi.unitn.it Credits: Luigi Palopoli, Giuseppe Lipari, Marco Di Natale, and Giorgio Buttazzo Scuola Superiore
More informationHigh level scheduling: Medium level scheduling: Low level scheduling. Scheduling 0 : Levels
Scheduling 0 : Levels High level scheduling: Deciding whether another process can run is process table full? user process limit reached? load to swap space or memory? Medium level scheduling: Balancing
More informationChapter 5: CPU Scheduling. Operating System Concepts 9 th Edit9on
Chapter 5: CPU Scheduling Operating System Concepts 9 th Edit9on Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling 1. Basic Concepts 2. Scheduling Criteria 3. Scheduling Algorithms 4. Thread
More informationD3.2 Prototype Operating System with Real-Time Support
Project Number 318763 D3.2 Prototype Operating System with Real-Time Support Version 1.0 Final Public Distribution Scuola Superiore Sant Anna, University of York Project Partners: aicas, HMI, petafuel,
More informationReservation-Based Scheduling for IRQ Threads
Reservation-Based Scheduling for IRQ Threads Luca Abeni University of Trento Via Sommarive 14, Povo (TN) luca.abeni@unitn.it Nicola Manica University of Trento Via Sommarive 14 Povo (TN) nicola.manica@gmail.com
More informationLinux Kernel Development (LKD)
Linux Kernel Development (LKD) Session 2 Kernel Build System and Process Management Paulo Baltarejo Sousa pbs@isep.ipp.pt 2017 PBS LKD: S2 1 / 41 Disclaimer Material and Slides Some of the material/slides
More informationINF1060: Introduction to Operating Systems and Data Communication. Pål Halvorsen. Wednesday, September 29, 2010
INF1060: Introduction to Operating Systems and Data Communication Pål Halvorsen Wednesday, September 29, 2010 Overview Processes primitives for creation and termination states context switches processes
More information11/04/2018. Outline. Process. Process. Pthread Library. Process and threads
Outline 1. General descriptions 2. Thread management 3. Scheduler(s) in Linux 4. Time management 5. Handling periodic threads 6. Mutual exclusion 7. Examples Process A process is the main execution entity
More informationMulticore CPU Reclaiming: Parallel or Sequential?
Multicore CPU Reclaiming: Parallel or Sequential? Luca Abeni, Giuseppe Lipari, Andrea Parri, Youcheng Sun To cite this version: Luca Abeni, Giuseppe Lipari, Andrea Parri, Youcheng Sun. Multicore CPU Reclaiming:
More informationChapter 5: Process Scheduling
Chapter 5: Process Scheduling Chapter 5: Process Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time CPU Scheduling Operating Systems
More informationReal-Time Scheduling. Dynamic Priority Servers
Real-Time Scheduling Dynamic Priority Servers Objectives Schedule soft aperiodic and hard periodic tasks Reduce average response time of aperiodic requests without compromising schedulability of periodic
More informationLITMUS RT : A Hands-On Primer
LITMUS RT : A Hands-On Primer Manohar Vanga, Mahircan Gül, Björn Brandenburg MPI-SWS, Kaiserslautern, Germany Goals A whirlwind tour of LITMUS RT Working with scheduler plugins. Running real-time tasks
More informationProcess management. Scheduling
Process management Scheduling Points of scheduler invocation (recap) User Kernel Return from system call Process Schedule Return from interrupt handler Timer interrupts to ensure OS control Return from
More informationTitolo presentazione. Scheduling. sottotitolo A.Y Milano, XX mese 20XX ACSO Tutoring MSc Eng. Michele Zanella
Titolo presentazione Scheduling sottotitolo A.Y. 2017-18 Milano, XX mese 20XX ACSO Tutoring MSc Eng. Michele Zanella Process Scheduling Goals: Multiprogramming: having some process running at all times,
More informationChapter 5 CPU scheduling
Chapter 5 CPU scheduling Contents Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples Java Thread Scheduling
More informationConstructing and Verifying Cyber Physical Systems
Constructing and Verifying Cyber Physical Systems Mixed Criticality Scheduling and Real-Time Operating Systems Marcus Völp Overview Introduction Mathematical Foundations (Differential Equations and Laplace
More informationProject 2: Android Scheduler
CS307 Project 2: Android Scheduler Fan Wu Department of Computer Science and Engineering Shanghai Jiao Tong University Spring 2018 1 Objectives 1. Compile the Android kernel. 2. Familiarize Android scheduler
More informationLITMUS RT : A Hands-On Primer
LITMUS RT : A Hands-On Primer Manohar Vanga, Mahircan Gül, Björn Brandenburg MPI-SWS, Kaiserslautern, Germany Goals A whirlwind tour of LITMUS RT Working with scheduler plugins. Running real-time tasks
More informationDeveloping Real-Time Applications
Developing Real-Time Applications Real Time Operating Systems and Middleware Luca Abeni luca.abeni@unitn.it Characterised by temporal constraints deadlines Concurrent (application: set of real-time tasks)
More informationJob Scheduling. CS170 Fall 2018
Job Scheduling CS170 Fall 2018 What to Learn? Algorithms of job scheduling, which maximizes CPU utilization obtained with multiprogramming Select from ready processes and allocates the CPU to one of them
More informationDepartment of Computer Science Institute for System Architecture, Operating Systems Group REAL-TIME MICHAEL ROITZSCH OVERVIEW
Department of Computer Science Institute for System Architecture, Operating Systems Group REAL-TIME MICHAEL ROITZSCH OVERVIEW 2 SO FAR talked about in-kernel building blocks: threads memory IPC drivers
More informationChapter 5 Scheduling
Chapter 5 Scheduling Images from Silberschatz Pacific University 1 Life time of a single process CPU usage/io bursts What would an IO bound process look like? What would a CPU bound process look like?
More informationOverview of Scheduling a Mix of Periodic and Aperiodic Tasks
Overview of Scheduling a Mix of Periodic and Aperiodic Tasks Minsoo Ryu Department of Computer Science and Engineering 2 Naive approach Background scheduling Algorithms Under static priority policy (RM)
More informationRespecting temporal constraints in virtualised services
Respecting temporal constraints in virtualised services Tommaso Cucinotta, Gaetano Anastasi Scuola Superiore Sant Anna Pisa, Italy {t.cucinotta,g.anastasi}@sssup.it Luca Abeni DISI - University of Trento
More informationTuned Pipes: End-to-end Throughput and Delay Guarantees for USB Devices. Ahmad Golchin, Zhuoqun Cheng and Richard West Boston University
Tuned Pipes: End-to-end Throughput and Delay Guarantees for USB Devices Ahmad Golchin, Zhuoqun Cheng and Richard West Boston University Motivations Cyber-physical applications Sensor-actuator loops Ubiquity
More informationCS356 Operating System Projects Spring Project 2: Android scheduler
CS356 Operating System Projects Spring 2018 Project 2: Android scheduler Objectives: Compile the Android kernel. Familiarize Android scheduler Implement a weighted round robin scheduler. Get experience
More informationLinux Kernel Development (LKD)
Linux Kernel Development (LKD) Session 3 CISTER Framework: Laboratory Paulo Baltarejo Sousa pbs@isep.ipp.pt 2017 1 LIFO Scheduling Algorithm It will be added a new scheduling policy to the CISTER framework.
More informationMASTER'S THESIS. Proportional and Sporadic Scheduling in Real-Time Operating Systems. Mikael Bertlin. Luleå University of Technology
MASTER'S THESIS 2008:061 CIV Proportional and Sporadic Scheduling in Real-Time Operating Systems Mikael Bertlin Luleå University of Technology MSc Programmes in Engineering Computer Science and Engineering
More informationComputer Science Window-Constrained Process Scheduling for Linux Systems
Window-Constrained Process Scheduling for Linux Systems Richard West Ivan Ganev Karsten Schwan Talk Outline Goals of this research DWCS background DWCS implementation details Design of the experiments
More informationReal-Time Systems Hermann Härtig Real-Time Operating Systems Brief Overview
Real-Time Systems Hermann Härtig Real-Time Operating Systems Brief Overview 02/02/12 Outline Introduction Basic variants of RTOSes Real-Time paradigms Common requirements for all RTOSes High level resources
More informationReal-Time Systems. Real-Time Operating Systems
Real-Time Systems Real-Time Operating Systems Hermann Härtig WS 2018/19 Outline Introduction Basic variants of RTOSes Real-Time paradigms Common requirements for all RTOSes High level resources Non-Real-Time
More informationMeasuring the impacts of the Preempt-RT patch
Measuring the impacts of the Preempt-RT patch maxime.chevallier@smile.fr October 25, 2017 RT Linux projects Simulation platform : bi-xeon, lots ot RAM 200µs wakeup latency, networking Test bench : Intel
More informationReal Time Operating Systems and Middleware
Real Time Operating Systems and Middleware Real-Time Programming Interfaces Luca Abeni abeni@dit.unitn.it Real Time Operating Systems and Middleware p. 1 Needs for a Real-Time Interface Real-Time applications
More informationLecture 3. Introduction to Real-Time kernels. Real-Time Systems
Real-Time Systems Lecture 3 Introduction to Real-Time kernels Task States Generic architecture of Real-Time kernels Typical structures and functions of Real-Time kernels Last lecture (2) Computational
More informationProgramming RT systems with pthreads
Programming RT systems with pthreads Giuseppe Lipari http://www.lifl.fr/~lipari CRIStAL - University de Lille 1 October 4, 2015 G. Lipari (CRIStAL) Programming RT systems with pthreads October 4, 2015
More informationLinux Kernel Development (LKD)
Linux Kernel Development (LKD) Session 2 CISTER Framework: Laboratory 2 Paulo Baltarejo Sousa pbs@isep.ipp.pt 2017 1 Introduction The goal of the CISTER framework is to create a set of tools that help
More informationLinux Tutorial. TA for class CSE 520S, Fall 09/20/2017 Haoran Li
Linux Tutorial TA for class CSE 520S, Fall 09/20/2017 Haoran Li Outline Ø Latency Measurement q in a single machine q between machines Ø Real-Time Schedulers 2 Measure Elapsed Time Why Elapsed Time First?
More informationIntel IXP400 Digital Signal Processing (DSP) Software: Priority Setting for 10 ms Real Time Task
Intel IXP400 Digital Signal Processing (DSP) Software: Priority Setting for 10 ms Real Time Task Application Note November 2005 Document Number: 310033, Revision: 001 November 2005 Legal Notice INFORMATION
More informationCS2506 Quick Revision
CS2506 Quick Revision OS Structure / Layer Kernel Structure Enter Kernel / Trap Instruction Classification of OS Process Definition Process Context Operations Process Management Child Process Thread Process
More informationAUTOBEST: A United AUTOSAR-OS And ARINC 653 Kernel. Alexander Züpke, Marc Bommert, Daniel Lohmann
AUTOBEST: A United AUTOSAR-OS And ARINC 653 Kernel Alexander Züpke, Marc Bommert, Daniel Lohmann alexander.zuepke@hs-rm.de, marc.bommert@hs-rm.de, lohmann@cs.fau.de Motivation Automotive and Avionic industry
More informationCopyright Notice. COMP9242 Advanced Operating Systems S2/2014 Week 9: Real-Time Systems. Real-Time System: Definition
Copyright Notice These slides are distributed under the Creative Commons Attribution.0 License COMP94 Advanced Operating Systems S/014 Week 9: Real- Systems @GernotHeiser You are free: to share to copy,
More informationServing Non Real-Time Tasks in a Reservation Environment
Serving Non Real-Time Tasks in a Reservation Environment Luca Abeni University of Trento Via Sommarive 14, I-38 POVO (TN) - Italy luca.abeni@unitn.it Claudio Scordino Computer Science Dept., University
More informationRound Robin (RR) ACSC 271 Operating Systems. RR Example. RR Scheduling. Lecture 9: Scheduling Algorithms
Round Robin (RR) ACSC 271 Operating Systems Lecture 9: Scheduling Algorithms Each process gets a small unit of CPU time (time quantum), usually 10-100 milliseconds. After this time has elapsed, the process
More informationThread Concept. Thread. No. 3. Multiple single-threaded Process. One single-threaded Process. Process vs. Thread. One multi-threaded Process
EECS 3221 Operating System Fundamentals What is thread? Thread Concept No. 3 Thread Difference between a process and a thread Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University
More informationDesign and Implementation of the Multiprocessor Bandwidth Inheritance Protocol on Linux
Design and Implementation of the Multiprocessor Bandwidth Inheritance Protocol on Linux Andrea Parri (a) a.parri@sssup.it Juri Lelli (a) j.lelli@sssup.it Mauro Marinoni (a) m.marinoni@sssup.it Giuseppe
More informationEvaluation of Real-time Performance in Embedded Linux. Hiraku Toyooka, Hitachi. LinuxCon Europe Hitachi, Ltd All rights reserved.
Evaluation of Real-time Performance in Embedded Linux LinuxCon Europe 2014 Hiraku Toyooka, Hitachi 1 whoami Hiraku Toyooka Software engineer at Hitachi " Working on operating systems Linux (mainly) for
More informationProject No. 2: Process Scheduling in Linux Submission due: April 12, 2013, 11:59pm
Project No. 2: Process Scheduling in Linux Submission due: April 12, 2013, 11:59pm PURPOSE Getting familiar with the Linux kernel source code. Understanding process scheduling and how different parameters
More informationScheduling. Scheduling 1/51
Scheduling 1/51 Scheduler Scheduling Scheduler allocates cpu(s) to threads and processes. This action is known as scheduling. The scheduler is a part of the process manager code that handles scheduling.
More informationREAL-TIME OPERATING SYSTEMS SHORT OVERVIEW
Faculty of Computer Science Institute of Systems Architecture, Operating Systems Group REAL-TIME OPERATING SYSTEMS SHORT OVERVIEW HERMANN HÄRTIG, WS 2017/18 OUTLINE Basic Variants of Real-Time Operating
More informationInferring Temporal Behaviours Through Kernel Tracing
Inferring Temporal Behaviours Through Kernel Tracing Paolo Rallo, Nicola Manica, Luca Abeni University of Trento Trento - Italy prallo@gmail.com, nicola.manica@disi.unitn.it, luca.abeni@unitn.it Technical
More informationIntegrated Schedulers for a Predictable Interrupt Management on Real-Time Kernels
Integrated Schedulers for a Predictable Interrupt Management on Real-Time Kernels S. Sáez A. Crespo Instituto de Automática e Informática Industrial Universidad Politécnica de Valencia 19th International
More informationIntroduction. This project will focus primarily on processes.
Project 2 Processes Introduction This project will focus primarily on processes. In this project, you will become familiar with: 1. Locks for kernel-level data structures; concurrency. 2. Implementing
More informationCS 326: Operating Systems. CPU Scheduling. Lecture 6
CS 326: Operating Systems CPU Scheduling Lecture 6 Today s Schedule Agenda? Context Switches and Interrupts Basic Scheduling Algorithms Scheduling with I/O Symmetric multiprocessing 2/7/18 CS 326: Operating
More informationInteractive Realtime Multimedia Applications on SOIs
Interactive Realtime Multimedia Applications on SOIs Advance Reservations for Distributed Real-Time Workflows with Probabilistic Service Guarantees Tommaso Cucinotta Real-Time Systems Laboratory Scuola
More informationINF1060: Introduction to Operating Systems and Data Communication. Operating Systems: Processes & CPU Scheduling. Thursday 22 September 16
INF1060: Introduction to Operating Systems and Data Communication Operating Systems: Processes & CPU Scheduling Thursday 22 September 16 Overview Processes primitives for creation and termination states
More informationKernel Critical Sections
Kernel Critical Sections Real Time Operating Systems and Middleware Luca Abeni luca.abeni@unitn.it Critical Sections in Kernel Code Old Linux kernels used to be non-preemptable... Kernel Big critical section
More informationMaRTE OS: Overview and Linux Version
MaRTE OS: Overview and Version Mario Aldea Rivas (aldeam@unican.es) Departamento de Electrónica y Computadores Universidad de Cantabria (Spain) Real-Time Systems Group, York, November 2004. DPTO. DE ELECTRÓNICA
More informationREAL-TIME OVERVIEW SO FAR MICHAEL ROITZSCH. talked about in-kernel building blocks:
Department of Computer Science Institute for System Architecture, Operating Systems Group REAL-TIME MICHAEL ROITZSCH OVERVIEW 2 SO FAR talked about in-kernel building blocks: threads memory IPC drivers
More informationChapter 6: CPU Scheduling. Operating System Concepts 9 th Edition
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Objectives To introduce CPU scheduling, which is the basis for multiprogrammed operating systems To describe various CPU-scheduling algorithms
More informationreal time operating systems course
real time operating systems course 4 introduction to POSIX pthread programming introduction thread creation, join, end thread scheduling thread cancellation semaphores thread mutexes and condition variables
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time CPU Scheduling Operating Systems Examples
More informationUNIT -3 PROCESS AND OPERATING SYSTEMS 2marks 1. Define Process? Process is a computational unit that processes on a CPU under the control of a scheduling kernel of an OS. It has a process structure, called
More informationChapter 6: CPU Scheduling. Operating System Concepts 9 th Edition
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time
More informationComputer Systems Laboratory Sungkyunkwan University
CPU Scheduling Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics General scheduling concepts Scheduling algorithms Case studies Linux
More informationLINUX AND REALTIME 1
LINUX AND REALTIME 1 PRESENTATION Pierre Morel - MNIS Paris and Toulouse - France pmorel@mnis.fr Linux Port on new architectures, Realtime and Virtualization OCERA european project on Realtime components
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time
More informationChapter 19: Real-Time Systems. Operating System Concepts 8 th Edition,
Chapter 19: Real-Time Systems, Silberschatz, Galvin and Gagne 2009 Chapter 19: Real-Time Systems System Characteristics Features of Real-Time Systems Implementing Real-Time Operating Systems Real-Time
More informationContext Switching & CPU Scheduling
Context Switching & CPU Scheduling Nima Honarmand Administrivia Midterm: next Tuesday, 10/17, in class Will include everything discussed until then Will cover: Class lectures, slides and discussions All
More informationECEN 449 Microprocessor System Design. Hardware-Software Communication. Texas A&M University
ECEN 449 Microprocessor System Design Hardware-Software Communication 1 Objectives of this Lecture Unit Learn basics of Hardware-Software communication Memory Mapped I/O Polling/Interrupts 2 Motivation
More informationScheduling policy. Reference: ULK3e 7.1. Scheduling in Linux 1 / 20
Scheduling policy Reference: ULK3e 7.1. Goals fast process response time good throughput for background jobs avoidance of process starvation reconciliation of needs of low- and high-priority processes
More informationD3.6 Final Operating System with Real-Time Support
Project Number 318763 D3.6 Final Operating System with Real-Time Support Version 1.0 Final Public Distribution Scuola Superiore Sant Anna Project Partners: aicas, HMI, petafuel, SOFTEAM, Scuola Superiore
More informationChapter 5: CPU Scheduling. Operating System Concepts 8 th Edition,
Chapter 5: CPU Scheduling Operating System Concepts 8 th Edition, Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2009 Chapter 5: Process Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms
More informationPROBABILISTIC SCHEDULING MICHAEL ROITZSCH
Faculty of Computer Science Institute of Systems Architecture, Operating Systems Group PROBABILISTIC SCHEDULING MICHAEL ROITZSCH DESKTOP REAL-TIME 2 PROBLEM worst case execution time (WCET) largely exceeds
More informationAperiodic Servers (Issues)
Aperiodic Servers (Issues) Interference Causes more interference than simple periodic tasks Increased context switching Cache interference Accounting Context switch time Again, possibly more context switches
More informationCSE 4/521 Introduction to Operating Systems
CSE 4/521 Introduction to Operating Systems Lecture 9 CPU Scheduling II (Scheduling Algorithms, Thread Scheduling, Real-time CPU Scheduling) Summer 2018 Overview Objective: 1. To describe priority scheduling
More informationScheduling. Scheduling 1/51
Scheduling 1/51 Learning Objectives Scheduling To understand the role of a scheduler in an operating system To understand the scheduling mechanism To understand scheduling strategies such as non-preemptive
More informationRT extensions/applications of general-purpose OSs
EECS 571 Principles of Real-Time Embedded Systems Lecture Note #15: RT extensions/applications of general-purpose OSs General-Purpose OSs for Real-Time Why? (as discussed before) App timing requirements
More information