Scribd
Upload
49 views

Advanced Systems:: Operating

The document discusses real-time scheduling in operating systems. It describes characteristics of real-time systems like determinism and responsiveness. Features of real-time operating systems include fast context switching, small size, quick interrupt response, and preemptive priority-based scheduling. Common real-time scheduling algorithms are static table-driven, priority-driven preemptive, and deadline-driven. Issues like priority inversion and unbounded priority inversion are also covered.

Uploaded by

Jagannath Jaggu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
49 views

Advanced Systems:: Operating

The document discusses real-time scheduling in operating systems. It describes characteristics of real-time systems like determinism and responsiveness. Features of real-time operating systems include fast context switching, small size, quick interrupt response, and preemptive priority-based scheduling. Common real-time scheduling algorithms are static table-driven, priority-driven preemptive, and deadline-driven. Issues like priority inversion and unbounded priority inversion are also covered.

Uploaded by

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

ADVANCED OPERATING SYSTEMS:

SEMINOR ON:
Real-Time Scheduling

UNDER THE GUIDENCE OF:


MAHAVEER B.E, M.Tech
ASST PROFESSOR
Dept of Computer science & Engg. PRESENTED BY:
SJMIT, Chitradurga JAGANNATH S.K
Operating Systems:
William Stallings

Chapter 10
10.2 Real-Time Scheduling
Real-Time Scheduling
• Correctness of the system depends not
only on the logical result of the
computation but also on the time at which
the results are produced
• Tasks or processes attempt to control or
react to events that take place in the
outside world
• These events occur in “real time” and
tasks must be able to keep up with them
Real-Time Systems
• Control of laboratory experiments
• Process control in industrial plants
• Robotics
• Air traffic control
• Telecommunications
• Military command and control systems
• Railway System
Characteristics
• Determinism
– Operations are performed at fixed,
predetermined times or within predetermined
time intervals
– Concerned with how long the operating
system delays before acknowledging an
interrupt and there is sufficient capacity to
handle all the requests within the required
time
Characteristics
• Responsiveness
– How long, after acknowledgment, it takes the
operating system to service the interrupt
– Includes amount of time to begin execution of
the interrupt
– Includes the amount of time to perform the
interrupt
– Effect of interrupt nesting
Characteristics
• User control
– User specifies priority
– Specify paging
– What processes must always reside in main
memory
– What disk transfer algorithms to use
– Rights of processes
Characteristics
• Reliability
- is more imp for real-time than non real-time
A trasient failure in a non-real time system may
be solved by simply rebooting the systems.
• Fail-soft operation
– Ability of a system to fail in such a way as to
preserve as much capability and data as
possible
Features of Real-Time OS
• Fast process or thread switch
• Small size
• Ability to respond to external interrupts
quickly
• Multitasking with interprocess
communication tools such as semaphores,
signals, and events
Features of Real-Time OS
• Use of special sequential files that can
accumulate data at a fast rate
• Preemptive scheduling based on priority
• Minimization of intervals during which
interrupts are disabled
• Delay tasks for fixed amount of time
• Special alarms and timeouts
Scheduling of Real-Time
Process
Scheduling of Real-Time
Process
Scheduling of Real-Time
Process
Scheduling of Real-Time
Process
Real-Time Scheduling
• Static table-driven
– Determines at run time when a task begins
execution
• Static priority-driven preemptive
– Traditional priority-driven scheduler is used
• Dynamic planning-based
– Feasibility determined at run time
• Dynamic best effort
– No feasibility analysis is performed
Deadline Scheduling
• Real-time applications are not concerned
with speed but with completing tasks
Deadline Scheduling
• Information used
– Ready time
– Starting deadline
– Completion deadline
– Processing time
– Resource requirements
– Priority
– Subtask scheduler
Two Tasks
Scheduling
Scheduling
Execution Profile
Rate Monotonic Scheduling
• Assigns priorities to tasks on the basis of
their periods
• Highest-priority task is the one with the
shortest period
Task Set
Periodic Task Timing Diagram
Priority Inversion
• Can occur in any priority-based
preemptive scheduling scheme
• Occurs when circumstances within the
system force a higher priority task to wait
for a lower priority task
Unbounded Priority Inversion
• Duration of a priority inversion depends on
unpredictable actions of other unrelated
tasks
Priority Inheritance
• Lower-priority task inherits the priority of
any higher priority task pending on a
resource they share

You might also like