Real-Time Scheduling - Lecture Notes | CS 4414, Study notes of Operating Systems

Material Type: Notes; Professor: Son; Class: Operating Systems; Subject: Computer Science; University: University of Virginia; Term: Spring 2008;

Typology: Study notes

Pre 2010

Uploaded on 07/29/2009

koofers-user-8rc
koofers-user-8rc 🇺🇸

5

(1)

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 414 : Operating Systems
UNIVERSITY OF VIRGINIA
Department of Computer Science
Spring 2008
Topic 8.1: Real-Time Scheduling
g
Real-time scheduling is priority-driven preemptive scheduling
g
All jobs are assumed to be periodic (not always the case)
g
Scheduling decisions are made
g
when any task arrives
g
when the processor becomes idle
g
At each decision, the process with the highest priority is executed
g
Processor is never left idle intentionally (greedy algorithms)
g
Types of scheduling: static or dynamic
g
Rate monotonic (RM)
g
Process with shorter period is assigned higher priority
g
Earliest deadline first (EDF)
g
process with the earliest deadline is assigned the highest priority
g
Example 1: A(2, 0.9), B(5,2.3)
g
Example 2: A(2,1), B(5,2.5)
g
Example 3: A(2,1), B(5,3)
g
Example 4: A(2,0.8), B(5,3.5)
8.1.1

Partial preview of the text

Download Real-Time Scheduling - Lecture Notes | CS 4414 and more Study notes Operating Systems in PDF only on Docsity!

Department of Computer Science^ UNIVERSITY OF VIRGINIA CS 414 : Operating Systems

Spring 2008 Topic 8.1: Real-Time Scheduling

g g g Real-time scheduling is priority-driven preemptive schedulingAll jobs are assumed to be periodic (not always the case)Scheduling decisions are made

g At each decision, the process with the highest priority is executed^ g^ g^ when any task arriveswhen the processor becomes idle g g Processor is never left idle intentionally (greedy algorithms)Types of scheduling: static or dynamic g g Rate monotonic (RM)Earliest deadline first (EDF) g Process with shorter period is assigned higher priority

g Example 1: A(2, 0.9), B(5,2.3)^ g^ process with the earliest deadline is assigned the highest priority g g g Example 2: A(2,1), B(5,2.5)Example 3: A(2,1), B(5,3)Example 4: A(2,0.8), B(5,3.5)

— 8.1.1 —