Scribd
Upload
12 views11 pages

PPart-3

Chaptet3

Uploaded by

dmretab
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
12 views11 pages

PPart-3

Chaptet3

Uploaded by

dmretab
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/ 11

 Real time task scheduling

 Real-time systems are systems that carry real-time tasks.


 These tasks need to be performed immediately

with a certain degree of urgency.


 Real-time task scheduling essentially refers

to determining the order in which the various


tasks are to be taken up for execution by the
operating system.
 Real-time task scheduling fundamentally

relates to determining how the operating


system chooses which tasks to execute.
 Everyoperating system relies on one or more task
schedulers.
a schedulers are used to plan the execution of various
tasks that must be completed.
 A real-time scheduling system is composed of the

scheduler, clock and the processing hardware


elements.
 In a real-time system, a process or task has schedule
 The scheduling algorithm used by each task

scheduler distinguishes it.


 Real time scheduling is two types these are:
I. Soft Real-Time scheduling which does not guarantee when
a critical real-time process will be scheduled
II. Hard Real-Time scheduling in which the process must be
scheduled before the deadline.
 Real-time tasks are scheduled to finish all the
computation events involved in it into timing
constraint.
 The timing constraint related to the real-time tasks is
the deadline.
 Real-Time Task Scheduling Algorithms

 The three main types of scheduling algorithms


according to this classification scheme are:
1,clock-driven:
_ These type algorithm simple and efficient.
_These are frequently used in embedded application
2, event-driven:
_ These type algorithm are more sophisticated than clock-
driven.
_ event-driven scheduler are more flexible than
clock-driven scheduler .
example rate monotonic analysis (RMA),Earliest
deadline first (EDF).
3,Hybrid:
_example round-robin.
 Dynamic allocation of tasks
 Dynamic allocation of real-time tasks refers to a
process of assigning real-time tasks to computing
resources.
 such as processors or memory, in a dynamic and
flexible manner based on the current system
conditions, resource availability.
 It involves making real-time decisions to allocate

system resources based on the changing conditions of


the system and the task priority.
 In
dynamic allocation, the system continuously
monitors the status of each task and resource, and
based on the real-time data.
 Tasks may have different priorities, and the allocation
policy can be adjusted .
 Dynamic allocation of real-time tasks can provide

several benefits .
 such as optimal use of system resources, improved

performance, increased system flexibility, and the


ability to handle unpredictable workloads.
 By dynamically allocating resources in real-time, the
system can provide better support for mission-critical
applications that require high reliability and
availability.
 Examples of dynamic allocation techniques include

load balancing, which distributes tasks among multiple


processors to improve system throughput and response
time, dynamic voltage scaling.
 applications of dynamic real-time task
allocation:
1, Smart Manufacturing:
-In a smart manufacturing environment, dynamic real-
time task allocation can be used to optimize
production schedules.
2, Autonomous systems:
-Autonomous systems such as self-driving cars,
drones, and robots can benefit from dynamic real-time
allocation.
3, Healthcare:
-Healthcare facilities can make use of this technology
by using real-time task allocation to assign tasks to
doctors, nurses, and other medical devices.
4, Service Industry:
-Customer service can dynamically allocate tasks.
5, Power Grid Management:
-Dynamic real-time task allocation can help power
grids optimize the distribution of power generation.
 advantages of dynamic real-time task
allocation:
 Optimal use of resources: Dynamic allocation of real-
time tasks ensures that resources are used optimally.
 Flexibility and Agility: Dynamic task allocation can
quickly adjust to changing environmental conditions.
 Improved Efficiency: Dynamic allocation of real-time

tasks improves efficiency by reducing idle time and


wait times, resulting in faster completion of tasks.
 Cost Optimization: Dynamic allocation of real-time

tasks helps organizations reduce costs.

You might also like