Professional Documents
Culture Documents
6) A system is real time the degree that it employs real time resource
management. The resources are explicitly managed for the purpose of
operating in real time.
Process creation
Process loading
CPU allocation
Process termination
OS Basics
Inter-process Communication
Synchronization and coordination
Deadlock detection
Process Protection
Memory Management
b) Missing some deadlines by some amount under some circumstances may be acceptable
rather than failure.
d) Soft real time means systems which have reduced constraints on “lateness” but still
must operate very quickly and repeatable.
Architecture of RTOS
The basic architecture of multitasking RTOS includes
a) Program interface b) The Kernel c)Device Drivers
d) Optional service modules
Interrupt Memory
Scheduling Network File
Dispatch Management Graphics
System
ANSI
Remote Support
Compliant
Logic and Real Time Procedure Library
C
character I/O Interposes Clock Calls
Library
Communication
File Support
Loader
Management Streams
Device Drivers
Disc Miscellaneous Network Parallel Serial
Requirement for Good RTOS
3) Fast Context Switch : The time between the OS recognizing that the
awaited event has arrived and the beginning of the waiting task is called
context switch time(dispatch latency).This switching time should be
minimum.
4) Control Of Memory Management :an OS should provide way for task
to lock its code and data into real memory so that it can guarantee
predictable response to a interrupt.
a) RTOS vendor must provide worst case execution times for all times
for all OS routines.
6) Deadline : It is the completion time constraint which specifies the timeliness of the threads
transit through the deadline scope whether the threads execution point reaches the end of the
scope before the deadline time has occurred ie.whether the deadline is met.
7) Hard Deadline: It is completion time constraint ie.the threads
execution point reaches the end of the deadline scope before the
deadline time occurs, then time constrained portion of threads
execution is timely otherwise that portion is not timely.
A) Pre-emptive Multitasking :
a) An external tick interrupt ,interrupts task at an
indeterminate point and passes control to kernel program.
b) The kernel will save the state of the interrupted task ad
then determine which task it should run next.
c) The Kernel restore the state of task and pass control of the
CPU to that task.
d) Task will continue to run until it is interrupted by next
external tick interrupt or voluntarily gives up allotted time
slice.
Preemptive Kernel
B) Non-preemptive Multitasking :
.
Non Preemptive Kernel
2) Process thread can be prioritized :
a) A OS schedules threads/or processes based on their relative priorities.
b) Processes are forced to relinquish the processor if a higher priority process becomes ready to
run.
c) Highest priority unable process will be executing on the system at all times
Task States
Task Switching
Task States
Process Scheduling Types
Types of Scheduling Policies
Deadline driven – ideal but not available
the CPU
Pre-emptive priority scheduling – higher priority