Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
20 views14 pages

3 Static Scheduler - Slide

The document discusses static scheduling in real-time systems, emphasizing its predictability and simplicity. It outlines the properties of static schedulers, including the use of a timetable for scheduling and the calculation of system utilization. Examples illustrate how to create and implement a static schedule for periodic tasks, ensuring all deadlines are met.

Uploaded by

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

3 Static Scheduler - Slide

The document discusses static scheduling in real-time systems, emphasizing its predictability and simplicity. It outlines the properties of static schedulers, including the use of a timetable for scheduling and the calculation of system utilization. Examples illustrate how to create and implement a static schedule for periodic tasks, ensuring all deadlines are met.

Uploaded by

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

REAL TIME SYSTEM

The Static Scheduler


STATIC SCHEDULER
• How
• Most Basic
• Common in real time system
• Desired features in Real time 1) Predictable 2) Simple
PROPERTIES OF STATIC SCHEDULER
• Schedule are store in time table
• t is the scheduling time (decision time)
• T is either a Job or “hole” starting at time t
SYSTEM UTILIZATION
𝑛
• Utilization U= 𝑖=1 𝑒𝑖/𝑝𝑖
• If U >1, then system is not feasible
UTILIZATION EXAMPLE
• Consider the following set of task
UTILIZATION EXAMPLE
• Consider the following set of task

• U= ?
• U= 1/3 + ¼ +2/10 = 0.7833
WHAT MAKES A SCHEDULER
• When timer expires at scheduling point
• Job from task T is schedule at time t
STATIC SCHEDULE
• Store pre-computed schedule as a table
• The system creates all the tasks that are to be executed:
• Allocates sufficient memory for the code and data of
every task
• Brings the code executed by the task into memory
• Scheduler sets the hardware timer to interrupt at the first
decision time, tk=0
• On receipt of an interrupt at tk:
• Scheduler sets the timer interrupt to expire at tk+1
• If T(tk) = I and aperiodic job waiting, start aperiodic job
• Otherwise, start next job in task T(tk) executing
STATIC/CYCLIC SCHEDULE ILLUSTRATED
• Consider a system with 4 independent periodic tasks:
• T1 = ( 4, 1.0)
• T2 = ( 5, 1.8)
• T3 = (20, 1.0)
• T4 = (20, 2.0)
• Hyper-period H = 20 (least common multiple of 4, 5, 20, 20)
• Can construct an arbitrary static schedule to meet all
deadlines:
STATIC SCHEDULE IMPLEMENTATION
STEP BY STEP EXAMPLE –STATIC SCHEDULE
• Schedule are created off line
• Precedence constraint are treated explicitly
• Scheduler only decides when timer expires
STEP BY STEP EXAMPLE –STATIC SCHEDULE
STEP BY STEP EXAMPLE –STATIC SCHEDULE
STEP BY STEP EXAMPLE –STATIC SCHEDULE

You might also like