Scribd
Upload
20 views2 pages

Module 4

1) The document discusses different types of constraints for real-time tasks including timing constraints, precedence relations, and mutual exclusion constraints on shared resources. 2) Timing constraints include deadlines that tasks must meet, with hard deadlines requiring completion to avoid catastrophe and soft deadlines impacting performance but not correctness. 3) Real-time tasks are characterized by parameters like arrival time, computation time, deadline, criticalness, value, lateness, tardiness, and laxity.

Uploaded by

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

Module 4

1) The document discusses different types of constraints for real-time tasks including timing constraints, precedence relations, and mutual exclusion constraints on shared resources. 2) Timing constraints include deadlines that tasks must meet, with hard deadlines requiring completion to avoid catastrophe and soft deadlines impacting performance but not correctness. 3) Real-time tasks are characterized by parameters like arrival time, computation time, deadline, criticalness, value, lateness, tardiness, and laxity.

Uploaded by

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

MODULE 4

Task constraints, Task scheduling: Aperiodic task scheduling: EDD. EDF, LDF, EDF with
precedence constraints. Periodic task scheduling:Rate monotonic and Deadline monotonic,
Real time Kernel- Structure, State transition diagram, Kernel primitives.
Types of task constraints:
Typical constraints that can be specified on real-time tasks are of three classes:
1. Timing constraints
2. Precedence relations
3. Mutual exclusion constraints on shared resources.

Timing constraints
Real-time systems are characterized by computational activities with stringent timing constraints
that must be met in order to achieve the desired behavior. A typical timing constraint on a task is
the deadline, which represents the time before which a process should complete its execution
without causing any damage to the system.
Depending on the consequences of a missed deadline, real-time tasks are usually distinguished
in two classes:
Hard: A task is said to be hard if a completion after its deadline can cause catastrophic
consequences on the system. In this case, any instance of the task should a priori be
guaranteed in the worst-case scenario.
Soft: A task is said to be soft if missing its deadline decreases the performance of the system
but does not jeopardize its correct behavior.
Characteristics of a real-time task
A real-time task Ji can be characterized by the following parameters:
1. Arrival time (ai) : It is the time at which a task becomes ready for execution; it is also
referred is request time or release time and indicated by ri.
2. Computation time (Ci) : is the time necessary to the processor for executing the task
without interruption;
3. Deadline (di) : is the time before which a task should be complete to avoid damage to
the system;
4. Start time (Si) : is the time at which a task starts its execution;
5. Finishing time (fi) : is the time at which a task finishes its execution;
6. Criticalness: is a parameter related to the consequences of missing the deadline.
7. Value (Vi) : represents the relative importance of the task with respect to the other tasks
in the system;
8. Lateness (Li) : Li = fi — di represents the delay of a task completion with respect to its
deadline; note that if a task completes before the deadline, its lateness is negative;
9. Tardiness or Exceeding time(Ei) : Ei = max{0, Li) is the time a task stays active after
its deadline;
10. Laxity or Slack time Xi : Xi — di — ai — Ci is the maximum time a task can be
delayed on its activation to complete within its deadline.

Periodic or aperiodic tasks


Periodic tasks consist of an infinite sequence of identical activities, called instances or jobs, that
are regularly activated at a constant rate. Aperiodic task will be denoted by τi , An aperiodic job
by Ji. The activation time of the first periodic instance is called phase.
If φi is the phase of the periodic τi , the task activation time of the kth instance is given by
φi + (k - 1)Ti,
where Ti is called period of the task.
The parameters Ci , Ti and Di are considered to be constant for each instance. Aperiodic tasks
also consist of an infinite sequence of identical activities. Their activations are not regular.

You might also like