Scribd
Upload
246 views18 pages

Rate Monotonic

This document compares two real-time scheduling policies: Rate Monotonic (RM) and Earliest Deadline First (EDF). RM assigns fixed priorities based on task periods, with shorter periods getting higher priority. It can schedule tasks with up to 69.2% CPU utilization. EDF uses dynamic priorities based on task deadlines, prioritizing the earliest deadline. It can schedule up to 100% CPU utilization but is more complex to implement. Both aim to meet all task deadlines but RM has more predictable behavior during overload while EDF fully utilizes CPU resources.

Uploaded by

bharavi227
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
246 views18 pages

Rate Monotonic

This document compares two real-time scheduling policies: Rate Monotonic (RM) and Earliest Deadline First (EDF). RM assigns fixed priorities based on task periods, with shorter periods getting higher priority. It can schedule tasks with up to 69.2% CPU utilization. EDF uses dynamic priorities based on task deadlines, prioritizing the earliest deadline. It can schedule up to 100% CPU utilization but is more complex to implement. Both aim to meet all task deadlines but RM has more predictable behavior during overload while EDF fully utilizes CPU resources.

Uploaded by

bharavi227
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

1

RATE MONOTONIC
&
EARLIEST DEADLINE FIRST
SCHEDULING POLICIES

WHY REAL TIME SCHEDULING?


2

There will be a number of tasks in a operating


systems.

Scheduling policies are used to provide scheduling


guarantees for every application.

Scheduling will be based on priorities.

Contd
3

Timeline scheduling is fragile during overload


situations, since a task exceeding its predicted
execution time could generate (if not aborted) a
domino effect on subsequent tasks.

Priorities can be fixed or dynamic.

RM and EDF are the widely used priority scheduling


algorithms.

RATE MONOTONIC SCHEDULING


4

Liu & Layland proposed and analyzed it in 1973.

Task with SHORTEST PERIOD gets HIGHEST


priority.

It is a fixed priority algorithm.

UTILIZATION FACTOR
5

The UTILIZATION FACTOR for RMS is

Ui=Ci/Ti is task utilization factor


Up is a processor utilization factor

Contd
6

Real-time system is schedulable under RM if


Ui n (21/n-1)

RMS can meet all the deadlines if CPU utilization is


less than 69.2%

SCHEDULING USING RMS


7

Fig1: T1,T2,T3 scheduled using RMS

DISADVANTAGES
8

Unmodified RMS will lead to priority


inversion and deadlock hazards.

This can be solved by using priority


inversion or disabling preemption.

Tasks may miss their deadline because


of static priorities.

DISADVANTAGES OF RMS
9

Fig2

Fig2:Missing of deadline in RMS

EARLIEST DEADLINE FIRST SCHEDULING


10

It is a dynamic priority scheduling.

A task with a shorter deadline has a higher priority

Executes a job with the earliest deadline

Contd
11

EDF is a optimal scheduling algorithm with on


preemptive single processors.

The number of tasks each characterized by an


arrival time,an execution requirement and a
deadline, EDF will ensure all of these jobs will be
completed by their deadline.

UTILIZATION FACTOR
12

Real-time system is schedulable under EDF if and


only if
Ui 1

EDF can meet all the deadlines if CPU utilization is


less than 100%

SCHEDULING USING EDF


13

Fig3:T1,T2,T3 Scheduled using EDF

DISADVANTAGES
14

When system is overloaded ,the set of processes that


will miss the deadline is unpredictable.

Hardware is complex one.

Deadline interchanges will occur.

So in most industrial applications RMS is used.

RMS VS EDF
15

RMS

Simpler
implementation
Processor utilization is
70%
Preemptions are more
Predictability for the
highest priority tasks

EDF

Complex
implementation
Full processor utilization

Preemptions are less


Misbehavior during
overload conditions

CONCLUSION
16

The advantage of RMS is simpler implementation


and predictability in overload conditions.

EDF is better in systems having limited resources as


it got complete CPU utilization

REFERENCES
17

Abdelzaher, T., Sharma, V., and Lu, C. 2004. A


utilization bound for aperiodic tasks and priority
driven scheduling. IEEE Transactions on Computers
53(3): 33435
Audsley, N. C., Burns, A., Richardson, M., Tindell,
K., and Wellings, A. 1993. Applying new scheduling
theory to static priority preemptive scheduling.
Software Engineering Journal 8(5): 284292.
Liu, C. L., and Layland, J.W. 1973. Scheduling
algorithms for multiprogramming in a hard real-time
environment.Journal of the ACM 20(1): 4061

THANK
YOU

18

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy