
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Notes; Professor: Son; Class: Operating Systems; Subject: Computer Science; University: University of Virginia; Term: Spring 2008;
Typology: Study notes
1 / 1
This page cannot be seen from the preview
Don't miss anything!

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 —