• makespan : If all jobs have same release time and deadline, then makespan = response time of

the last job to execute.

• • A processor, P, is an active component on which jobs scheduled

• • A resource, R, is a passive entity upon which jobs may depend

• – E.g. memory, sequence numbers, mutexes, database locks, etc.

• – Resources have different types and sizes, but do not have a speed attribute

• – Resources are usually reusable, and are not consumed by use

• Resources can be divided into passive and active:

– Active resources == Processors (Pi): they execute jobs.

• Every job must have one or more processors

• Same type if functionally identical and used interchangeably.

– Passive resource == Resource (Ri):

• job may require Resources in addition to processor.

• reusable resources are not consumed

Job/Task Temporal Parameters

• Hard real-time: number and parameters of tasks are known at all time.

• for Job Ji:

– ri - release time, may know range [r-, r+] (jitter). For aperiodic/sporadic release or
interrelease time is a random variable.

– di - absolute deadline

– Di - relative deadline

– (ri, di] - feasible interval

– ei - Execution time. May know range [e-, e+]. Most deterministic models use e+.

Periodic Task Model

• Jobs repeated at regular or semi-regular intervals modeled as periodic.

• Task Ti is a series of periodic Jobs Jij.

– pi - period, minimum interrelease interval between jobs in Task Ti. Must be bounded
from below.
 – ei - maximum execution time for jobs in task Ti.

– rij - release time of the jth Job in Task i (Jij in Ti).

– i - phase of Task Ti, equal to ri1.

– H - Hyperperiod = Least Common Multiple of pi for all i: H = lcm(pi), for all i.

– ui - utilization of Task Ti.

– U - Total utilization = Sum over all ui.

Release and Response Time

• Release time – the instant in time when a job becomes available

for execution

– May not be exact: Release time jitter so ri is in the interval [ri-, ri+] – A job can be scheduled and
executed at any time at, or after, its release time, provided its resource dependency conditions are met

• Response time – the length of time from the release time of the

job to the time instant when it completes

– Not the same as execution time, since may not execute continually

• Earliest Deadline First (EDF)

– Process with earliest deadline given highest priority

• Least Slack Time First (LSF)

– slack = relative deadline – execution left

• Rate Monotonic Scheduling (RMS)

– For periodic tasks

– Tasks priority inversely proportional to it’s period