© 2000 Morgan Kaufman Overheads for Computers as Components Processes and operating systems  Operating systems.

Slides:

Advertisements

Similar presentations

Washington WASHINGTON UNIVERSITY IN ST LOUIS Real-Time: Periodic Tasks Fred Kuhns Applied Research Laboratory Computer Science Washington University.

Advertisements

Real Time Scheduling.

Chapter 7 - Resource Access Protocols (Critical Sections) Protocols: No Preemptions During Critical Sections Once a job enters a critical section, it cannot.

Introduction to Embedded Systems Resource Management - III Lecture 19.

CSC 360- Instructor: K. Wu Overview of Operating Systems.

© 2004, D. J. Foreman 1 Scheduling & Dispatching.

SCHEDULING Kshama Desai Bijal Shah Kishore Putta Kashyap Sheth.

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.

Big Picture Lab 4 Operating Systems Csaba Andras Moritz.

Project 2 – solution code

CS 3013 & CS 502 Summer 2006 Scheduling1 The art and science of allocating the CPU and other resources to processes.

Real-Time Kernels and Operating Systems. Operating System: Software that coordinates multiple tasks in processor, including peripheral interfacing Types.

Wk 2 – Scheduling 1 CS502 Spring 2006 Scheduling The art and science of allocating the CPU and other resources to processes.

By Group: Ghassan Abdo Rayyashi Anas to’meh Supervised by Dr. Lo’ai Tawalbeh.

November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #29-1 Chapter 33: Virtual Machines Virtual Machine Structure Virtual Machine.

1Chapter 05, Fall 2008 CPU Scheduling The CPU scheduler (sometimes called the dispatcher or short-term scheduler): Selects a process from the ready queue.

Process Scheduling in Windows XP, Linux, and UNIX By Sarah G. Levinson CSC 4320.

Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-3 CPU Scheduling Department of Computer Science and Software Engineering.

Fair Resource Access & Allocation  OS Scheduling

LOGO OPERATING SYSTEM Dalia AL-Dabbagh

1 Previous lecture review n Out of basic scheduling techniques none is a clear winner: u FCFS - simple but unfair u RR - more overhead than FCFS may not.

Linux and Real Time Real-time systems are characterized by deadlines. When a missed deadline results in inconvenience or a diminished customer experience,

Real-Time Operating Systems for Embedded Computing 李姿宜 R ,06,10.

1 RTOS Design Some of the content of this set of slides is taken from the documentation existing on the FreeRTOS website

CPU Scheduling CSCI 444/544 Operating Systems Fall 2008.

ICOM Noack Scheduling For Distributed Systems Classification – degree of coupling Classification – granularity Local vs centralized scheduling Methods.

© 2000 Morgan Kaufman Overheads for Computers as Components Processes and operating systems Operating systems. 1.

2.5 Scheduling Given a multiprogramming system. Given a multiprogramming system. Many times when more than 1 process is waiting for the CPU (in the ready.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Lecture 7: CPU Scheduling Chapter 5.

Lecture 7: Scheduling preemptive/non-preemptive scheduler CPU bursts

1 Review of Process Mechanisms. 2 Scheduling: Policy and Mechanism Scheduling policy answers the question: Which process/thread, among all those ready.

Cpr E 308 Spring 2005 Process Scheduling Basic Question: Which process goes next? Personal Computers –Few processes, interactive, low response time Batch.

1 VxWorks 5.4 Group A3: Wafa’ Jaffal Kathryn Bean.

1 Real-Time Scheduling. 2Today Operating System task scheduling –Traditional (non-real-time) scheduling –Real-time scheduling.

CSCI1600: Embedded and Real Time Software Lecture 24: Real Time Scheduling II Steven Reiss, Fall 2015.

2.5 Scheduling. Given a multiprogramming system, there are many times when more than 1 process is waiting for the CPU (in the ready queue). Given a multiprogramming.

Real time scheduling G.Anuradha Ref:- Stallings. Real time computing Correctness of the system depends not only on the logical result of computation,

Introduction to Embedded Systems Rabie A. Ramadan 5.

CSCI1600: Embedded and Real Time Software Lecture 23: Real Time Scheduling I Steven Reiss, Fall 2015.

CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 31 – Process Management (Part 1) Klara Nahrstedt Spring 2009.

CS333 Intro to Operating Systems Jonathan Walpole.

For a good summary, visit:

Time Management.  Time management is concerned with OS facilities and services which measure real time.  These services include:  Keeping track of.

Uniprocessor Process Management & Process Scheduling Department of Computer Science Southern Illinois University Edwardsville Spring, 2016 Dr. Hiroshi.

1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.

Unit - I Real Time Operating System. Content : Operating System Concepts Real-Time Tasks Real-Time Systems Types of Real-Time Tasks Real-Time Operating.

Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.

Lecture 4 CPU scheduling. Basic Concepts Single Process  one process at a time Maximum CPU utilization obtained with multiprogramming CPU idle :waiting.

CPU scheduling.  Single Process  one process at a time  Maximum CPU utilization obtained with multiprogramming  CPU idle :waiting time is wasted 2.

1 Lecture 5: CPU Scheduling Operating System Fall 2006.

Lecturer 5: Process Scheduling Process Scheduling  Criteria & Objectives Types of Scheduling  Long term  Medium term  Short term CPU Scheduling Algorithms.

Big Picture Lab 4 Operating Systems C Andras Moritz

Real-Time Operating Systems RTOS For Embedded systems.

CPU Scheduling Scheduling processes (or kernel-level threads) onto the cpu is one of the most important OS functions. The cpu is an expensive resource.

REAL-TIME OPERATING SYSTEMS

Wayne Wolf Dept. of EE Princeton University

Unit OS9: Real-Time and Embedded Systems

Chapter 2 Scheduling.

Virtual Memory Networks and Communication Department.

Real-time Software Design

Chapter 15 – Part 1 The Internal Operating System

CSCI1600: Embedded and Real Time Software

EE 472 – Embedded Systems Dr. Shwetak Patel.

CSCI1600: Embedded and Real Time Software

Processes and operating systems

Processes and operating systems

Chapter 10 Multiprocessor and Real-Time Scheduling

Scheduling & Dispatching

Scheduling & Dispatching

Presentation transcript:

© 2000 Morgan Kaufman Overheads for Computers as Components Processes and operating systems  Operating systems.

© 2000 Morgan Kaufman Overheads for Computers as Components Operating systems  The operating system controls resources:  who gets the CPU;  when I/O takes place;  how much memory is allocated.  The most important resource is the CPU itself.  CPU access controlled by the scheduler.

© 2000 Morgan Kaufman Overheads for Computers as Components Process state  A process can be in one of three states:  executing on the CPU;  ready to run;  waiting for data. executing readywaiting gets data and CPU needs data gets data needs data preempted gets CPU

© 2000 Morgan Kaufman Overheads for Computers as Components Operating system structure  OS needs to keep track of:  process priorities;  scheduling state;  process activation record.  Processes may be created:  statically before system starts;  dynamically during execution.

© 2000 Morgan Kaufman Overheads for Computers as Components Embedded vs. general- purpose scheduling  Workstations try to avoid starving processes of CPU access.  Fairness = access to CPU.  Embedded systems must meet deadlines.  Low-priority processes may not run for a long time.

© 2000 Morgan Kaufman Overheads for Computers as Components Time quanta  Quantum: unit of time for scheduling.

© 2000 Morgan Kaufman Overheads for Computers as Components Priority-driven scheduling  Each process has a priority.  CPU goes to highest-priority process that is ready.  Priorities determine scheduling policy:  fixed priority;  time-varying priorities.

© 2000 Morgan Kaufman Overheads for Computers as Components Priority-driven scheduling example  Rules:  each process has a fixed priority (1 highest);  highest-priority ready process gets CPU;  process continues until done or wait state.  Processes  P1: priority 1, execution time 10  P2: priority 2, execution time 30  P3: priority 3, execution time 20

© 2000 Morgan Kaufman Overheads for Computers as Components Priority-driven scheduling example time P2 ready t=0P1 ready t=15 P3 ready t= P2 P1P3

© 2000 Morgan Kaufman Overheads for Computers as Components The scheduling problem  Can we meet all deadlines?  Must be able to meet deadlines in all cases.  How much CPU horsepower do we need to meet our deadlines?

© 2000 Morgan Kaufman Overheads for Computers as Components Process initiation disciplines  Periodic process: executes on (almost) every period.  Aperiodic process: executes on demand.  Analyzing aperiodic process sets is harder- --must consider worst-case combinations of process activations.

© 2000 Morgan Kaufman Overheads for Computers as Components Timing requirements on processes  Period: interval between process activations.  Initiation interval: reciprocal of period.  Initiation time: time at which process becomes ready.  Deadline: time at which process must finish.

© 2000 Morgan Kaufman Overheads for Computers as Components Timing violations  What happens if a process doesn’t finish by its deadline?  Hard deadline: system fails if missed.  Soft deadline: user may notice, but system doesn’t necessarily fail.

© 2000 Morgan Kaufman Overheads for Computers as Components Example: Space Shuttle software error  Space Shuttle’s first launch was delayed by a software timing error:  Primary control system PASS and backup system BFS.  BFS failed to synchronize with PASS.  Change to one routine added delay that threw off start time calculation.  1 in 67 chance of timing problem.