Swi Scheduling Hwi Swi Tsk Idle

Slides:



Advertisements
Similar presentations
Scheduling Criteria CPU utilization – keep the CPU as busy as possible (from 0% to 100%) Throughput – # of processes that complete their execution per.
Advertisements

CPU Scheduling Tanenbaum Ch 2.4 Silberchatz and Galvin Ch 5.
Operating Systems Process Scheduling (Ch 3.2, )
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Introduction to SYS/BIOS
Operating System Process Scheduling (Ch 4.2, )
Operating System I Process Scheduling. Schedulers F Short-Term –“Which process gets the CPU?” –Fast, since once per 100 ms F Long-Term (batch) –“Which.
5: CPU-Scheduling1 Jerry Breecher OPERATING SYSTEMS SCHEDULING.
Real-Time Kernels and Operating Systems. Operating System: Software that coordinates multiple tasks in processor, including peripheral interfacing Types.
Operating Systems Process Scheduling (Ch 4.2, )
MicroC/OS-II Embedded Systems Design and Implementation.
IN2305-II Embedded Programming Lecture 5: Survey of SW Architectures.
Operating System Process Scheduling (Ch 4.2, )
Performance Evaluation of Real-Time Operating Systems
Windows 2000 Scheduling Computing Department, Lancaster University, UK.
OPERATING SYSTEMS CPU SCHEDULING.  Introduction to CPU scheduling Introduction to CPU scheduling  Dispatcher Dispatcher  Terms used in CPU scheduling.
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.
Chapter 6 Scheduling. Basic concepts Goal is maximum utilization –what does this mean? –cpu pegged at 100% ?? Most programs are I/O bound Thus some other.
Processes and Threads CS550 Operating Systems. Processes and Threads These exist only at execution time They have fast state changes -> in memory and.
DSP/BIOS Scheduling Chapter 9 C6000 Integration Workshop Copyright © 2005 Texas Instruments. All rights reserved. Technical Training Organization T TO.
Chapter 5: Process Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Basic Concepts Maximum CPU utilization can be obtained.
RTOS task scheduling models
Cpr E 308 Spring 2005 Process Scheduling Basic Question: Which process goes next? Personal Computers –Few processes, interactive, low response time Batch.
RTX - 51 Objectives  Resources needed  Architecture  Components of RTX-51 - Task - Memory pools - Mail box - Signals.
DSP/BIOS System Integration Workshop Copyright © 2004 Texas Instruments. All rights reserved. T TO Technical Training Organization Introduction.
Group no.2 Presented to : Eng.Ahmed Hassan Sunday, March 04,2012.
1 VxWorks 5.4 Group A3: Wafa’ Jaffal Kathryn Bean.
1/9/ :46 1 Priority Model Real-time class Idle Above Normal Normal Below Normal Lowest Highest 31 Time-critical Dynamic classes.
DSP/BIOS System Integration Workshop Copyright © 2004 Texas Instruments. All rights reserved. T TO Technical Training Organization 1 1.Introduction 2.Real-Time.
1.  System Characteristics  Features of Real-Time Systems  Implementing Real-Time Operating Systems  Real-Time CPU Scheduling  An Example: VxWorks5.x.
Chapter 3 RTOS Concepts And Definitions Department of Computer Science Hsu Hao Chen Professor Hsung-Pin Chang.
1 Uniprocessor Scheduling Chapter 3. 2 Alternating Sequence of CPU And I/O Bursts.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
3. CPU Scheduling. CPU Scheduling Process execution – a cycle of CPU execution and I/O wait – figure Preemptive Non-Preemptive.
Real-Time Operating Systems RTOS For Embedded systems.
Chapter 4 DSP/BIOS. DSP/BIOS Part 1 - Introduction.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 6: CPU Scheduling.
UNIT–II: Process Management
REAL-TIME OPERATING SYSTEMS
EEE Embedded Systems Design Process in Operating Systems 서강대학교 전자공학과
Topics Covered What is Real Time Operating System (RTOS)
Networks and Operating Systems: Exercise Session 2
Chapter 2 Scheduling.
Chapter 5: CPU Scheduling
CPU Scheduling.
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
Process management Information maintained by OS for process management
ICS 143 Principles of Operating Systems
CPU Scheduling Basic Concepts Scheduling Criteria
CPU Scheduling G.Anuradha
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter5: CPU Scheduling
Chapter 5: CPU Scheduling
Chapter 6: CPU Scheduling
CPU SCHEDULING.
Outline Scheduling algorithms Multi-processor scheduling
CPU scheduling decisions may take place when a process:
Process Scheduling Decide which process should run and for how long
EE 472 – Embedded Systems Dr. Shwetak Patel.
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Shortest-Job-First (SJR) Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Real-Time Process Scheduling Concepts, Design and Implementations
Chapter 6: CPU Scheduling
Real-Time Process Scheduling Concepts, Design and Implementations
Module 5: CPU Scheduling
Presentation transcript:

Swi Scheduling Hwi Swi Tsk Idle Hardware Interrupts Hwi priorities set by hardware Fixed number, preemption optional Hard R/T Swi Software Interrupts Up to 32 priority levels Any number possible, all preemptive Tsk Tasks Up to 32 priority levels Any number possible, all preemptive Idle Background Continuous loop Non-realtime in nature Soft R/T SYS/BIOS provides for Hwi and Swi management. SYS/BIOS allows the Hwi to post a Swi to the ready queue.

Hardware and Software Interrupt System Execution flow for flexible real-time systems: INT ! Hard R/T Process Post Swi Cleanup, RET Hwi SWI Ready Continue Processing ... Swi Hwi Fast response to INTs Min context switching High priority for CPU Limited # of Hwi possible isrAudio: Swi Latency in response time Context switch Selectable priority levels Scheduler manages execution *buf++ = *XBUF; cnt++; if (cnt >= BLKSZ) { Swi_post(swiFir); count = 0; pingPong ^= 1; } SYS/BIOS provides for Hwi and Swi management. SYS/BIOS allows the Hwi to post a Swi to the ready queue.

Scheduling Rules Swi_post(swi_b) Highest Priority Hwi swi_b (p2) swi_a (p1) Running Ready Legend Idle Lowest Priority This diagram shows two task of unequal priority. First the lower priority task is running and is interrupted by an ISR which then runs a higher priority task. The lower priority task running is preempted and rescheduled. After the higher priority task is completed it prompts the lower priority task to run time Swi_post(mySwi) : Unconditionally post a software interrupt (in the ready state). If a higher priority thread becomes ready, the running thread is preempted. Swi priorities range from 1 to 32. Automatic context switch (uses system stack) What if more than one Swi process is set to the same priority?

Scheduling Rules Swi_post(swi_b) Highest Priority Hwi swi_b (p1) swi_a (p1) Running Ready Legend Idle Lowest Priority If threads are at the same priority to solve the “resource conflict” problem, this can be dangerous IF someone comes along and changes the priorities. Be careful. time Processes of same priority are scheduled first-in first-out (FIFO). Having threads at the SAME priority offers certain advantages, such as resource sharing (without conflicts).