0% found this document useful (0 votes)

103 views

RTOS For Embedded System Design: Mr. Anand H. D

The document discusses an overview of real-time operating systems (RTOS) for embedded system design. It covers topics such as operating system basics, types of operating systems, tasks, processes and threads, multiprocessing and multitasking, task scheduling, and how to choose an RTOS. The syllabus includes these topics. It then discusses operating system architecture and functions such as memory management, process management, time management, file system management, I/O system management, and secondary storage management.

Uploaded by

Karan Jagannath

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

103 views

RTOS For Embedded System Design: Mr. Anand H. D

Uploaded by

Karan Jagannath

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 128

RTOS for Embedded System Design

Mr. Anand H. D.

Department of Electronics & Communication Engineering

Dr. Ambedkar Institute of Technology
Bengaluru-56

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 1

Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

SYLLABUS:
Operating System basics

Types of operating systems

Task, process and threads

Multiprocessing and Multitasking

Task scheduling

How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 2

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Operating System (OS) acts as a bridge between user applications/tasks and the
underlying system resources through a set of system functionalities and services.

The OS manages the system resources and makes them available to the user
applications/tasks on a need basis .

The primary functions of OS are:

1. Make the system convenient to use.
2. Organize and mange the system resources efficiently and correctly.

The Kernel:
➢ Is the core of OS and is responsible for managing the system resources and the
communication among the hardware and other system services.

➢ Acts as the abstraction layer between system resources and user applications.

➢ Contains a set of system libraries and services.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 3

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Now let us consider the Architecture of OS:

General Purpose OS contains different services for handling

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 4

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Now let us consider the Architecture of OS:

General Purpose OS contains different services for handling

Primary Memory Management:

Refers to volatile memory RAM, where processes are loaded
and variables and shared data associated with process are
stored.
The Memory Management Unit (MMU) of the kernel is
responsible for
•Keeping track of which part of memory area is currently used
by which process.
•Allocating and de-allocating memory space on need basis
(Dynamic Memory Allocation)

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 4

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Now let us consider the Architecture of OS:

General Purpose OS contains different services for handling

Primary Memory Management:

Process Management:
•Deals with managing the processes/tasks.
•By setting up the memory space for the process, loading the
process’s code into the memory space, allocating system
resources, scheduling and managing execution of process,
setting up and managing the Process Control Block (PCB),
Inter-process Communication and synchronization, process
termination/deletion etc.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 4

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Time Management:
Deals with at what time which process needs to be scheduled.
Till what duration processes needs to be executed.
After what time a process needs to be preempted.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 4

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Time Management:
Deals with at what time which process needs to be scheduled.
Till what duration processes needs to be executed.
After what time a process needs to be preempted.

File System Management:

➢File is collection of information.
➢A file could be a program, text file, image file, word
documents, audio/video files etc.
➢Each of these files differ in kind of information they hold
and the way in which information is stored.

➢The file system management service of kernel is responsible

for:
•Creation, deletion and alteration of files.
•Creation, deletion and alteration of directories.
•Saving of files in secondary storage memory.
•Providing automatic allocation of file space based on amount
of free space available.
•Providing a flexible naming convention for the files.

➢The various file system management operations are OS

dependent.
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 4

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

I/O System Management:
➢Kernel is responsible for routing the I/O request coming from different
user applications to the appropriate I/O devices of the system
➢In a well structured OS direct access of I/O devices is not allowed and
access to them is provided through a Application Programming
Interfaces (API) exposed by kernel.
➢Kernel maintains a list of I/O devices of the system. This list may be
available well in advance at the time of building the kernel or in cases
Kernels dynamically updates the list and where the new device is
installed.
➢The service ‘Device Manager’ is responsible handling all I/O device
related operations.
➢The kernel talks to I/O devices through a set of low level system calls,
which are implemented in a service called device drivers. These drivers
are specific to a device or a class of devices.
➢The device manager is responsible for :
•Loading & unloading of device drivers.
• Exchanging information and the system specific controls to and from
the device.
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 4

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

The Operating System Architecture

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 4

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Secondary Storage Management: Protection System:

➢Deals with management of secondary storage devices. ➢Most of the modern OS are deigned in such a way that they
➢Secondary memory is used as a backup medium for program support multiple users with different levels of access permissions .
and data since the main memory is volatile. ➢Protection deals with implementing the security polices to
➢In most of the systems the secondary storage is in the for of restrict the access to both user and system resources by different
disks (Hard disks). applications or processes or users.
➢The secondary storage management services of kernel deals ➢In multiuser OS, one user may not be allowed to view or modify
with : Disk Storage allocation. complete portion of another user’s data or profile details.
Disk Scheduling . ➢Also some applications may not be granted permissions to make
Free disk space management use of certain system resources.

Interrupt Handler:
➢Kernel provides handler mechanism for all external/internal interrupts generated by the system.

➢These are some of the services offered by kernel of an OS.

➢Depending on type of OS, a kernel may contain lesser/more number of services/components.
➢In addition to above mentioned services many OS offer a no. of add-on services to kernel, Network communication, network
management, user-interface graphics, timer services, error handler, database management etc.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 5

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Kernel Space Vs User Space:

➢The applications/services are classified into : User applications and Kernel applications
➢The program code corresponding to kernel applications/services are kept in contiguous area of primary memory and
is protected from unauthorized access by user programs/applications—Kernel Space
➢All user programs are loaded to a specific area of primary memory and this memory area is referred as User space.
➢The portioning of memory into Kernel space and user space is purely OS dependent.
➢In OS with virtual memory support, the user applications are loaded into corresponding virtual memory space
with demand paging technique — the entire code for user application need not be loaded into main memory at once;
instead user application is divided into different pages and these pages are loaded into and out of main memory area
on a need basis – Swapping.
➢Swapping happens between main memory and secondary storage memory.
➢Each process run in its own virtual memory space and are not allowed accessing the memory space corresponding
to another processes unless explicitly requested by the process.
➢Most of the OS keep the kernel application code in main memory and it is not swapped out into the secondary
memory.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 6

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Monolithic Kernel and Microkernel:

Monolithic Kernel
➢In monolithic kernel architecture, all kernel services run in
the kernel space.
➢All kernel modules run in same memory space under a
single kernel thread.
➢Tight internal integration of kernel modules allows the
effective utilization of the low level features of the
underlying system.
➢Major drawback is that any error or failure in any one of
the kernel modules leads to the crashing of entire kernel
applications.
➢LINUX, MS-DOS, SOLARIS are examples of monolithic
kernel OS.
The Monolithic kernel Model
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 7

Operating System basics
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Microkernel
➢Incorporates only essential set of OS services into the
kernel and rest of OS services are implemented in programs
known as Servers which run in user space.
➢Provides a highly modular design and OS-neutral
abstraction to the kernel.
➢Memory management, process management, time system
and interrupt handlers are essential services which forms the
part of microkernel.
➢Mach, QNX, MINIX3 are examples of microkernel OS.
➢Offers 2 benefits:
•Robustness: server programs can be reconfigured &
restarted, chances of corruption are ideally zero.
•Configurability: any server application can be changed
without restarting the entire system—dynamically
The Microkernel Model
configurable
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 8

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Depending on kernel and kernel services, purpose and type of computing systems where OS is deployed and
responsiveness to applications, OSs are classified into 2 types:
General Purpose Operating System (GPOS)
Real-Time Operating System (RTOS)

General Purpose Operating System (GPOS) Real-Time Operating System (RTOS)

➢Deployed in general computing systems. ➢Real-time implies deterministic timing behavior.
➢Kernel is more generalized and it contains all kinds of ➢Means OS services consumes only known and expected
services required for executing generic applications. amounts of time regardless the number of services.
➢Often non-deterministic in behavior, there services can ➢RTOS implements policies and rules concerning time-
inject random delays into application software and may critical allocation of system resources.
cause slow responsiveness of an application at unexpected ➢RTOS decides which application should run in which
times. order and how much time must be allocated for each
➢They are often deployed in general computing systems application.
where deterministic behavior is not important. ➢Predictable performance is hallmark of RTOS. This is
➢Personal computers/desktop system is typical example of achievable by consistent application of policies and rules.
a system where GPOS is deployed. ➢Windows CE, QNX, VxWorks, MicroC/OS-II etc. are
➢Windows XP/MS-DOS etc. are examples of GPOSs. examples of RTOS

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 9

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Real Time Kernel:

➢kernel of RTOS

➢Compare to conventional OS kernel Real

Time kernel is highly specialized and it
contains only minimal set of services required
for running the user applications/tasks.

➢The basic functions of Real Time Kernel

are:
•Task/Process management.
•Task/Process scheduling.
•Task/Process synchronization.
•Error/Exception Handling.
•Memory management.
•Interrupt Handling.
•Time Management

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 10

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Real Time Kernel: Task/Process management:

➢Deals with setting up the memory space for the tasks, loading the task’s code
➢kernel of RTOS into the memory space, allocating system resources, setting up a Task Control
Block (TCB) for the task, termination and deletion.
➢Compare to conventional OS kernel Real ➢TCB is used to hold information corresponding to task which includes:
Time kernel is highly specialized and it •Task ID •Task state
contains only minimal set of services required •Task type •Task Priority

for running the user applications/tasks. •Task context pointer •Task memory pointers
•Task system resource pointers •Task pointers.
➢The basic functions of Real Time Kernel
➢Implementation of TCB is kernel dependent.
are: ➢Task management service uses TCB of a task in following way:
•Creates a TCB for a task on creating a task.
•Task/Process management.
•Delete/remove TCB of task when task is terminated/deleted
•Task/Process scheduling. •Reads TCB to get the state of task.
•Update TCB with updated parameters on need basis.
•Task/Process synchronization.
•Modify TCB to change task priority dynamically.
•Error/Exception Handling.
•Memory management.
•Interrupt Handling.
•Time Management

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 10

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Real Time Kernel: Task/Process management:

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 10

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Real Time Kernel: Task/Process synchronization:

➢Deals with the synchronization of concurrent access of resources, which is shared
➢kernel of RTOS across multiple tasks and communication between various tasks.

➢Compare to conventional OS kernel Real

Time kernel is highly specialized and it
contains only minimal set of services required
for running the user applications/tasks.

➢The basic functions of Real Time Kernel

are:
•Task/Process management.
•Task/Process scheduling.
•Task/Process synchronization.
•Error/Exception Handling.
•Memory management.
•Interrupt Handling.
•Time Management

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 10

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Real Time Kernel: Task/Process synchronization:

➢Deals with the synchronization of concurrent access of resources, which is shared
➢kernel of RTOS across multiple tasks and communication between various tasks.

➢Compare to conventional OS kernel Real Error/Exception Handling:

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 10

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Real Time Kernel: Task/Process synchronization:

➢Deals with the synchronization of concurrent access of resources, which is shared
➢kernel of RTOS across multiple tasks and communication between various tasks.

➢Compare to conventional OS kernel Real Error/Exception Handling:

➢Deals with registering and handling the errors occurred/exceptions raised during
Time kernel is highly specialized and it execution of tasks.
➢Insufficient memory, timeouts, deadlocks, deadline missing, bus error, divide by
contains only minimal set of services required
zero, unknown instruction execution etc. are examples of errors/exceptions.
for running the user applications/tasks. ➢Errors/Exceptions can occur at kernel level services or at task level. Deadlock is an
kernel level error whereas timeout is an example for task level.
➢The basic functions of Real Time Kernel ➢The OS kernel gives the information in the form of System Call (API).
➢Watchdog timer will be used for handling timeouts.
are:
•Task/Process management.
Memory Management:
➢Compare to GPOS, memory management of RTOS is slightly different.
•Task/Process scheduling. ➢Memory allocation time increases depending upon the block of memory needs to
be allocated and state of allocated memory.
•Task/Process synchronization. ➢RTOS makes use of ‘block’ based memory allocation technique instead of usual
•Error/Exception Handling. dynamic memory allocation used by GPOS.
➢RTOS kernel uses blocks of fixed size of dynamic memory and block is allocated
•Memory management. to a task on need basis. The blocks are stored in ‘free buffer queues’.
➢To achieve predictable timing and avoid timing overhead, RTOS allows task to
•Interrupt Handling. access any memory blocks without any memory protection.
•Time Management ➢Few RTOS kernels implement Virtual Memory concept of memory allocation if
system supports secondary memory storage.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 10

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Real Time Kernel: Interrupt Handling:

➢Deals with handling different types of interrupts.
➢kernel of RTOS ➢Interrupts provide Real time behavior to system. Interrupts inform the
processor that an external device or an associated task requires
➢Compare to conventional OS kernel Real immediate attention of CPU.
Time kernel is highly specialized and it ➢Interrupts can be Synchronous or Asynchronous.
➢Interrupts that occur in sync with currently executing task are known
contains only minimal set of services required
as Synchronous interrupts — usually software interrupts – divide by 0,
for running the user applications/tasks. memory segmentation error etc. are few examples.
➢For Synchronous interrupts the interrupt handler runs in same context
➢The basic functions of Real Time Kernel of interrupting task.
are: ➢Interrupts that occur at any point of execution of any task and are not
in sync with currently executing task are Asynchronous interrupts. –
•Task/Process management.
generated by external devices connected to process/controller – timer
•Task/Process scheduling. overflow interrupts, serial data reception/transmission interrupts etc. are
•Task/Process synchronization. examples.
➢For Asynchronous interrupts the interrupt handler is usually written as
•Error/Exception Handling. separate task and it runs in different context. Hence a context-switch
•Memory management. occurs while handling an asynchronous interrupt.
➢Priority levels can be assigned to interrupts and each interrupts can be
•Interrupt Handling.
enabled and disabled individually.
•Time Management ➢Most of the RTOS kernel implements ‘Nested interrupts’ architecture,
which allows interruption of a Interrupt Service Routine (ISR), while
servicing an interrupt, by a high priority interrupt.
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 10

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Real Time Kernel: Time Management:

➢Accurate time management is essential for providing precise time
➢kernel of RTOS reference to all applications.
➢The time reference to kernel is provided by a high resolution Real-
➢Compare to conventional OS kernel Real Time-Clock (RTC) hardware chip.
Time kernel is highly specialized and it ➢The hardware timer is programmed to interrupt the processor/controller
at a fixed interval. This is referred as ‘timer tick’. Usually varies in µsec.
contains only minimal set of services required
➢If timer tick interval is 1 µsec, system time register will reset in
for running the user applications/tasks.

➢The basic functions of Real Time Kernel ➢If timer tick interval is 1 millisecond, system time register will reset in
are:
•Task/Process management.
➢This timer tick can be utilized for:
•Task/Process scheduling. •Save the current context.
•Task/Process synchronization. •Increment the timer register by one.
•Update the timers implemented in kernel.
•Error/Exception Handling. •Activate the periodic tasks, which are in idle state.
•Memory management. •Invoke the scheduler and schedule the tasks again based on scheduling
algorithm.
•Interrupt Handling.
•Delete all terminated tasks and associated data structures (TCBs).
•Time Management •Load the context for first task in the ready queue.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 10

Operating System basics Types of operating systems
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Hard Real Time: ➢Ideally speaking the response time of air bag system
➢RTOSs that strictly adhere to the timing constraints must be zero and bags should be deployed exactly
for a task are referred as ‘Hard Real Time’ systems. within the time frame which is predefined.
➢Hard real time system must meet the deadlines for a ➢Any delay in deployment of air-bags makes the life
task without any slippage. Missing any deadlines may of passengers under threat.
produce catastrophic results for Hard real time systems ➢When the airbag deployment task is triggered, the
including permanent data lose and irrecoverable currently executing task must be preempted, airbag
damages to the system/users. deployment task must be brought into execution and
➢Emphasizes on ‘ a late answer is a wrong answer’ . necessary I/O systems should be made readily available
➢Air bag control system and Anti-lock Braking ➢As a Thumb rule hard real time systems doesn’t
System (ABS) are typical examples. implement virtual memory model. This eliminates the
➢The airbag control system must be into action and delay in swapping in and out the code.
deploy the airbags when vehicles meet severe ➢Most of the Hard Real Time systems are automatic
accident. and does not contain a ‘human in the loop (HITL)’.

Soft Real Time:

➢RTOSs that does not guarantee meeting deadlines but offer the best effort to meet the deadlines are referred as
‘Soft Real Time’ systems.
➢Missing deadlines for tasks are acceptable if the frequency of deadline missing is within the compliance limit of
‘Quality of Service (QoS)’ .
➢Emphasizes on ‘ a late answer is a an acceptable answer, but it could have done bit faster’.
➢Most often have ‘Human in the loop (HITL)’ ,Automatic Teller machine (ATM) is a typical example.
➢A audio-video playback system is another example.
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 11

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

➢In OS context a ‘task’ is defined as the program in execution and the related information maintained by the OS
for the program.
➢A task is also known as ‘job’ in OS context.
➢A program or part of it in execution is also called a ‘Process’
➢The terms ‘task’, ‘job’ and ‘process’ refer to the same entity in the OS context and most often they are used
interchangeably.

Process:
➢Also known as an instance of program in execution.
➢Multiple instances of the same program can execute simultaneously.
➢A process requires various system resources like CPU for executing the process, memory for storing the code
corresponding to the process and associated variables, I/O devices for information exchange etc.
➢A process is sequential in execution.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 12

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Memory Organization of a Process:
➢A process which inherits all properties of CPU can be considered as a
virtual processor, awaiting its turn to have its properties switched into
physical processor.
➢When process gets it turn, its registers and the PC register maps to
physical registers of CPU.
➢On loading a process into main memory, a specific area of memory
is allocated for the process.
➢The memory occupied by process is segregated into 3 regions:
•Stack Memory—holds all temporary data such as variables local to the
process.
•Data Memory – holds all global data for the process.
•Code Memory – contains the program code corresponding to process.
➢Stack memory starts at the highest address from allocated memory and
grows downwards.
➢Say if allocated memory area for process is 2048-2100, the stack
memory starts at address 2100 and grows downwards. Memory organization of a Process

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 14

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Memory Organization of a Process:
➢A process which inherits all properties of CPU can be considered as a
virtual processor, awaiting its turn to have its properties switched into
physical processor.
➢When process gets it turn, its registers and the PC register maps to
physical registers of CPU.
➢On loading a process into main memory, a specific area of memory is
allocated for the process.
➢The memory occupied by process is segregated into 3 regions:
•Code Memory – contains the program code corresponding to process.
•Stack Memory—holds all temporary data such as variables local to the
process.
•Data Memory – holds all global data for the process.
➢Stack memory starts at the highest address from allocated memory and
grows downwards.
➢Say if allocated memory area for process is 2048-2100, the stack
memory starts at address 2100 and grows downwards. Memory organization of a Process

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 14

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

•Data Memory – holds all global data for the process.

•Stack Memory—holds all temporary data such as variables local to the
process.

➢from allocated memory and grows downwards.

➢Say if allocated memory area for process is 2048-2100, the stack

memory starts at address 2100 and grows downwards.
Memory organization of a Process

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 14

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Memory Organization of a Process:
➢A process which inherits all properties of CPU can be considered as a
virtual processor, awaiting its turn to have its properties switched into
physical processor.
➢When process gets it turn, its registers and the PC register maps to
physical registers of CPU.
➢On loading a process into main memory, a specific area of memory is
allocated for the process.
➢The memory occupied by process is segregated into 3 regions:
•Code Memory – contains the program code corresponding to process.
•Data Memory – holds all global data for the process.
•Stack Memory—holds all temporary data such as variables local to the
process.
➢Stack memory starts at the highest address from allocated memory and
grows downwards.
➢Say if allocated memory area for process is 2048-2100, the stack
memory starts at address 2100 and grows downwards. Memory organization of a Process

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 14

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Memory Organization of a Process:
➢A process which inherits all properties of CPU can be considered as a
virtual processor, awaiting its turn to have its properties switched into
physical processor.
➢When process gets it turn, its registers and the PC register maps to
physical registers of CPU.
➢On loading a process into main memory, a specific area of memory is
allocated for the process.
➢The memory occupied by process is segregated into 3 regions:
•Code Memory – contains the program code corresponding to process.
•Data Memory – holds all global data for the process.
•Stack Memory—holds all temporary data such as variables local to the
process.
➢Stack memory starts at the highest address from allocated memory and
grows downwards.
➢Say if allocated memory area for process is 2048-2100, the stack
memory starts at address 2100 and grows downwards. Memory organization of a Process

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 14

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Memory Organization of a Process:
➢A process which inherits all properties of CPU can be considered as a
virtual processor, awaiting its turn to have its properties switched into
physical processor.
➢When process gets it turn, its registers and the PC register maps to
physical registers of CPU.
➢On loading a process into main memory, a specific area of memory is
allocated for the process.
➢The memory occupied by process is segregated into 3 regions:
•Code Memory – contains the program code corresponding to process.
•Data Memory – holds all global data for the process.
•Stack Memory—holds all temporary data such as variables local to the
process.
➢Stack memory starts at the highest address from allocated memory
and grows downwards.
➢Say if allocated memory area for process is 2048-2100, the stack
memory starts at address 2100 and grows downwards. Memory organization of a Process

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 14

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Process States and State Transition:
➢The creation of a process to its termination is not a single step
operation.
➢The process traverses a series of states during its transition from
newly created state to terminated state – ‘Process Life Cycle’.
‘Created’ state – state at which a process is created, OS recognizes
that a process is created but no resources are allocated.
‘Ready’ state – state where a process is incepted into the memory
and awaiting Processor time for execution. Processes is placed in
‘Ready list queue’.
‘Running’ state – state at which a process execution happens.
‘Blocked/Wait’ state – state where a running process is temporarily
suspended from execution and does not have immediate access to
resources.
‘Completed’ state – state where process completes its execution.
➢Transistion of a process from one state to another is called as
Process Sates & State transition representation
‘State Transistion’

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 15

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Threads:
➢A thread is the primitive that can execute
code.
➢A thread is a single sequential flow of
control within a process.
➢Thread is also known as light weighted
process.
➢A process can have many threads of
execution.
➢Different threads, which are part of a
process, share the same address space (same
code, data and heap memory area).
➢Threads maintain there own thread status—
CPU register values, PC and stack.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 16

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 16

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 16

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 16

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 16

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 16

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 16

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 17

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

The concept of Multithreading:

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 17

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

The concept of Multithreading:

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 17

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

The concept of Multithreading:

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 17

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

The concept of Multithreading:

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 17

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Thread Standard:
➢Thread standard deals with different standards available for thread creation and management.
➢These standards utilize OS for thread creation and management. It is a set of thread class libraries.
➢The commonly available thread class libraries are POSIX threads, Win32 Threads, Java Threads etc.
POSIX Threads:
➢Stands for Portable Operating System Interface.
➢POSIX. 4 standard deals with real time extensions and POSIX.4a standard deals with thread extensions.
➢The POSIX standard library for thread creation and management is ‘Pthreads’.
➢The Pthreads library defines the set of POSIX thread creation and management functions in ‘C’ language.

int pthread_create(pthread_t new_thread_ID, const pthread_attr_t attribute,

void * (*start function) (void *), void *arguments;

➢The above primitive is used for creating new thread for running the function start_function.
➢Here pthread_t is the handle to newly created thread and pthread_attr_t is data type for holding thread attributes.
➢Start_function is the function, the thread is going to execute, arguments is the arguments for start_function
➢On successful creation of a Pthread, Pthread_create() associates the TCB corresponding to the newly created thread to
variable of type Pthread_t
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 18

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

int pthread_join (pthread_t new_thread, void , thread_status);

➢The above primitive blocks the current thread and waits until the completion of the thread pointed by it.
➢All POSIX thread calls return an integer.
➢A return value of zero indicates the success of the call. It is always good to check the return value of each call.

Example:
Write a multithread appliction to print “Hello I’m in main thread” from the main thread and “Hello I’m in new
thread” 5 times each, using pthread_create() and pthread_join() POSIX primitives.

#include <pthread.h> for (j=0;j<5;j++)

#include <stdlib.h> {
#include <stdio.h> printf( “Hello I’m in new thread\n”);
for (i=0;i<10000;i++)
Void *new_thread (void *thread_args)
}
{
return NULL;
int i,j;
}

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 19

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

int main (void) if (pthread_join(tcb, NULL))

{ {
int i,j; printf(“Error in thread joining\n”);
pthread_t tcb; return -1;
If (pthread_create(&tcb, NULL, new-thread ,NULL)) }
{ return 1;
printf(“Error in creating new thread\n”); }
return -1;
➢Termination of thread can happen in different ways:
}
•Natural termination—threads completes executions and returns
for (j=0;j<5;j++)
back to main thread through simple return or by executing
{
pthread_exit().
printf( “Hello I’m in main thread\n”);
•Forced termination—by calling pthread_cancel() or termination
for (i=0;i<10000;i++)
of main thread with exit or exec function.
}
➢Exiting with pthread_exit() will not perform a cleanup.
➢Calling pthread_join() at the end of main thread is best way to
achieve synchronization and cleanup.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 20

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads

Multiprocessing and Multitasking Task scheduling How to choose an RTOS.

Thread Process
Thread is a single unit of execution and is part of Process is a program in execution and contains one or
process. more threads.

Thread does not have its own data memory and Process has its own code memory, data memory and stack
heap memory. It shares the data memory and memory
heap memory with other threads of same process.

Thread cannot live independently: it lives within Process contains at least one thread
the process.

There can be multiple threads in a process. The Threads within a Process shares data, code and heap
first thread calls the main function and occupies memory. Each thread holds separate memory area for
the start of stack memory of the process. stack.(Share the total stack memory of process)
Threads are very inexpensive to create. Process are very expensive to create as they involve many
OS overhead.

Context switching is inexpensive. and fast Context switching is complex and involves lot of OS
overhead and comparatively slower.

If a Thread expires, its stack is reclaimed by the If a process dies, the resources allocated to it reclaimed by
process. OS and all associated threads of the process also dies.
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 21

➢Multiprocessing and Multitasking sounds alike.

➢In OS context Multiprocessing describes the ability to execute multiple processes simultaneously.
➢Systems that are capable of performing multiprocessing, are known as multiprocessor systems.
➢Multiprocessor systems posses multiple processors (CPUs) and can execute multiple processes simultaneously.
➢The ability of OS to hold multiple programs in memory, which are ready for execution is referred as
Multiprogramming.
➢In uniprocessor system, it is not possible to execute multiple process simultaneously.
➢However with uniprocessor system it is possible to achieve some degree of pseudo parallelism in the execution
of multiple processes by switching the execution among different processes.
➢The ability of the processor to hold multiple processes in memory and switch the processor from executing one
process to another process is known as multitasking.
➢Multitasking creates the illusion of multiple tasks executing in parallel.
➢In a multitasking environment when task/process switching happens, the virtual processor (task/process) gets its
properties converted into that of physical processor. This is controlled by scheduler of OS kernel.
➢Whenever a CPU switching happens, the current context of execution should be saved to retrieve it at a later
stage when CPU switches to process which was interrupted due to execution switching.
➢This context saving and later retrieval is essential for resuming exactly from the point where it was interrupted.
➢Act of switching CPU among the processes or changing current execution context— ‘Context switching’
➢Act of saving the current context details(Registers, memory, system resource, execution time etc.)— ‘Context
saving’
➢Process of retrieving the saved context details for a process, which is going to resume its execution— ‘Context
retrieval’
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 22

Multitasking involves ‘Context Switching’, ‘Context Saving’ and ‘Context Retrieving’.

Process

Time
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 23

Multitasking involves ‘Context Switching’, ‘Context Saving’ and ‘Context Retrieving’.

Process

running

idle

Process 1
Time
RTOS for Embedded System Design

Types of Multitasking:
Co-operative Multitasking:
➢Most primitive form of multitasking, in which a task/process gets a chance to execute only when currently
executing voluntarily relinquishes the CPU.
➢Any task/process can hold CPU as much time as it wants.
➢This name because, this type of implementation involves mercy of tasks for each other to get CPU time for
execution.
➢If tasks are non-cooperative, the other tasks have to wait for a long time to get the CPU.

Preemptive Multitasking:
➢Ensures that every task/process gets a chance to execute.
➢When and how much time a process gets is dependent on the implementation of preemptive scheduling.
➢The currently running task/process is preempted to give a chance to other tasks/processes to execute.
➢Preemption of task may be based on time slots or task/process priority.

Non-Preemptive Multitasking:
➢The task/process to which CPU is currently allocated is allocated to execute until it terminates or enters
‘Blocked/wait’ state, waiting for I/O or system resource.
➢In cooperative multitasking process/task will not relinquish CPU when it enters s ‘Blocked/wait’ state.
➢Where as in Non-preemptive multitasking currently executing process/task relinquish CPU when it waits for an
I/O or system resource or an event to occur.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 24

➢Determining which task/process is to be executed at given point if time is known as Task Scheduling.

➢Task scheduling forms the basis for multitasking.

➢Scheduling polices form the guidelines for determining which task is to be executed when.

➢The scheduling polices are run in an algorithm by the OS kernel as a service.

➢The kernel service/application which implements scheduling algorithm, is known as Scheduler.

➢The process scheduling decision may take place under 4 scenarios, when a process switches its state to:
•Ready’ State from ‘Running’ State — Scenario 1
•‘Blocked/Wait’ State from ‘Running’ State — Scenario 2
•‘Ready’ State from ‘Blocked/Wait’ State — Scenario 3
•‘Completed’ State — Scenario 4
Scenario 1: A process switches to ‘Ready’ state from ‘Running’ state when its preempted.— Preemptive Scheduling.
Scheduling in Scenario 2 can be either preemptive or non-preemptive.
Scenario 3: When a high priority process in Blocked/Wait state , the scheduler picks it for execution if scheduling
policy is priority based preemptive.
Scheduling under Scenario 4 can be preemptive, non-preemptive or cooperative scheduling.
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 25

The selection of a scheduling criterion/algorithm should consider the following factors:

➢CPU Utilization: should be high. It is the direct measure of how much percentage of CPU is being utilized.
➢Throughput: indicates no. of processes executed per unit time. It should always be higher.
➢Turnaround time: It is the amount of time taken by a process for completing its execution.
It includes time spent by process for waiting for the main memory, time spent in the ready queue, time
spent on completing I/O operations and time spent in execution.
➢Waiting Time: It is the amount of time spent by process in ‘Ready’ queue waiting to get CPU, should be minimal.
➢Response Time: time elapsed between submission of process and the first response, should be as least as possible.

Therefore a good scheduling algorithm should have high CPU utilization, minimum Turn Around Time
(TAT), maximum throughput and least response time.

➢The OS maintains various queues in connection with CPU scheduling and a process passes through these queues
during the course of admittance to execution completion.
•Job queue: contains all processes in the system.
•Ready queue: contains all processes which are ready for execution and waiting for CPU. Empty when no
process is ready for running.
•Device queue contains processes, which are waiting for an I/O device

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 26

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Now let us consider an diagrammatic representation that shows transition of Process through various queues:

Illustration of Process transition through various queues

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 27

Non-Preemptive Scheduling:
➢Non-Preemptive Scheduling is employed in systems, which implement non-preemptive multitasking model.
➢The currently executing task/process is allowed to run until it terminates or enters the Block/Wait state waiting for
an I/O or system resource.
➢The various types of non-preemptive scheduling adopted in task/process scheduling are:
First Come First Served (FCFS)/FIFO Scheduling
Last Come First Served (LCFS)/LIFO Scheduling
Shortest Job First (SJF) Scheduling
Priority Based Scheduling

First Come First Served (FCFS)/FIFO Scheduling:

➢Allocates CPU time to the process based on order in which they enter the ‘Ready’ queue.
➢Example is Ticket reservation system where people need to stand in a queue and the first person in the queue is
serviced first.
➢The first entered process is serviced first, also called as First In First Out (FIFO) scheduling.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 28

Turn Around Time of Process, P1 = 10ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P2 = 15ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 22ms (time spent in Ready Queue + Execution Time)
Therefore, Average Turn Around Time = (Turn Around Time of (P1+P2+P3) / 3)
(10 + 15 +22) / 3 = 47/3 = 15.66 milliseconds

Average Execution Time = (Execution Time of (P1+P2+P3) / 3)

(10 + 5 +7) / 3 = 22/3 = 7.33 milliseconds
Average Turn Around Time = Average waiting time + Average Execution Time
8.33 + 7.33 = 15.66 milliseconds

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 29

Turn Around Time of Process, P2 = 5ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P1 = 15ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 22ms (time spent in Ready Queue + Execution Time)
Therefore, Average Turn Around Time = (Turn Around Time of (P2+P1+P3) / 3)
(5 + 15 +22) / 3 = 42/3 = 14 milliseconds

Average Execution Time = (Execution Time of (P2+P1+P3) / 3)

(5 + 10 +7) / 3 = 22/3 = 7.33 milliseconds
Average Turn Around Time = Average waiting time + Average Execution Time
6.66 + 7.33 = 14 milliseconds

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 30

Analysis:
The Average Waiting Time and Average Turn Around Time depends upon order in which the processes enter
the ‘Ready’ queue.
The Average Waiting Time and Average Turn Around Time improves if the process with shortest execution
time is scheduled first.
Major Drawbacks are:
➢It favors monopoly of process. A process, which does not contain any I/O operation continues it execution till it
finishes. If the task/process contains I/O operation, the CPU is relinquished by the process.
➢In general FCFS algorithm favors CPU bound processes and I/O bound processes must wait until completion of
CPU bound processes, if currently executing process is a CPU bound Process.
➢This leads to poor device utilization. Average waiting Time is not minimal for FCFS scheduling algorithm.

Last Come First Served (LCFS)/LIFO Scheduling:

➢Also allocates CPU time to the process based on order in which they enter the ‘Ready’ queue.
➢The Last entered process is serviced first, also called as Last In First Out (LIFO) scheduling where the the process,
which is put last into ‘Ready’ queue is serviced first.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 31

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads
0000
Multiprocessing and Multitasking Task scheduling
Multiprocessing and Multitasking Task scheduling How to choose an RTOS.
Example 1:Three processes with process IDs P1,P2 and P3 with estimated completion time 10,5,7 milliseconds respectively enters the
ready queue together in the order P1,P2,P3 (Assume only P1 is present in ‘Ready’ queue when the scheduler picks it up and P2, P3
entered ‘Ready’ queue after that ). Now a new process, P4 with estimated completion time 6 ms enters the ‘Ready’ queue after 5ms of
scheduling P1. Calculate the waiting time and Turn Around Time(TAT) for each process and the average waiting time and average
Turn Around Time(Assuming there is no I/O bound Processes.)
Initially there is only P1 available in the ready queue and the
scheduling sequence will be P1, P3, P2. P1 P4 P3 P2
P4 enters the queue during execution of P1and becomes the last
process to enter the ‘Ready’ queue. Now the order of execution
0 10 16 23 28
changes to P1, P4, P3, P2 and can be represented as: 6 5
10 7
waiting time of Process, P1 = 0ms (P1 starts execution first)
waiting time of Process, P4 = 5ms (P4 starts execution after completion of P1 but P4
arrived after 5ms of execution of P1, (10-5=5))
waiting time of Process, P3 = 16ms (P3 starts execution after completion of P1 and P4)
waiting time of Process, P2 = 23ms (P2 starts execution after completion of P1, P4 & P3)

Therefore, Average waiting time = (waiting time of (P1+P4+P3+P2) / 4)

(0 + 5 +16 + 23) / 4 =44/4 = 11 milliseconds
Turn Around Time of Process, P1 = 10ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P4 = 11ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 23ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P2 = 28ms (time spent in Ready Queue + Execution Time)

Therefore, Average Turn Around Time = (Turn Around Time of (P1+P4+P3 + P2) / 4)
(10 + 11+23+28) / 4 = 72/4 = 18 milliseconds

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 32

Shortest Job First (SJF) Scheduling:

➢Sorts the ‘Ready’ queue each time the ready queue relinquishes the CPU to pick the process with the shortest
estimated completion / run time.
➢The process with shortest estimated run time is scheduled first, followed by next shortest Process and so on.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 33

The waiting time for all processes is given by:

5 7 10

waiting time of Process, P2 = 0 ms (P2 starts execution first)

waiting time of Process, P3 = 5 ms (P3 starts execution after completion of P2 )
waiting time of Process, P1 = 12 ms (P3 starts execution after completion of P2 and P3)

Therefore, Average waiting time = (waiting time of (P2+P3+P1) / 3)

(0 + 5 +12) / 3 = 17/3 = 5.66 milliseconds

Turn Around Time of Process, P2= 5ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 12ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P1 = 22ms (time spent in Ready Queue + Execution Time)

Therefore, Average Turn Around Time = (Turn Around Time of (P1+P2+P3) / 3)

(5 + 12 +22) / 3 = 39/3 = 13 milliseconds

From this example, it is clear that Average waiting time and Average Turn Around Time is much improved for SJF scheduling
for same processes compare to FCFS scheduling.
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 34

Therefore, Average waiting time = (waiting time of (P2+P4+P3+P1) / 4)

(0 + 3 + 7 + 14) / 4 =24/4 = 6 milliseconds
Turn Around Time of Process, P2 = 5ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P4 = 5ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 14ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P1 = 24ms (time spent in Ready Queue + Execution Time)

Therefore, Average Turn Around Time = (Turn Around Time of (P2+P4+P3 + P1) / 4)
(5+ 5+14+24) / 4 = 48/4 = 12 milliseconds
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 35

Analysis:
The Average Waiting Time and Average Turn Around Time minimal for SJF scheduling and so it is optimal
compared to other non-preemptive scheduling.

Major Drawbacks are:

➢A process whose estimated execution completion time high may not get a chance to execute if more and more
processes with least estimated execution time enters the ‘Ready’ queue before the process with longest estimated
execution time started its execution — Starvation.
➢It is difficult to know in advance the next shortest Process in the ‘Ready’ queue for scheduling since new
process with different estimated execution time keep entering the ‘Ready’ queue at any point of time.

Priority Based Scheduling:

➢Priority based non-preemptive scheduling ensures that a process with high priority is serviced at the earliest
compared to other low priority processes in the ‘Ready’ queue.
➢Priority of a task/process can be indicated through various mechanisms.
➢SJF algorithm can be viewed as a priority based scheduling where process is prioritized in the order of time required
to complete the task.
➢Priority can be 0 to maximum priority supported by the OS.
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 36

The waiting time for all processes is given by:

10 7 5

waiting time of Process, P1 = 0 ms (P2 starts execution first)

waiting time of Process, P3 = 10 ms (P3 starts execution after completion of P1)
waiting time of Process, P2 = 17 ms (P3 starts execution after completion of P1 and P3)

Therefore, Average waiting time = (waiting time of (P1+P3+P2) / 3)

(0 + 10 +17) / 3 = 27/3 = 9 milliseconds

Turn Around Time of Process, P1= 10ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 17ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P2 = 22ms (time spent in Ready Queue + Execution Time)

Therefore, Average Turn Around Time = (Turn Around Time of (P1+P3+P2) / 3)

(10 + 17 +22) / 3 = 49/3 = 16.33 milliseconds

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 37

waiting time of Process, P1 = 0ms (P2 starts execution first)

waiting time of Process,P4 = 5ms (P4 starts execution after completion of P1 but P4
arrived after 2ms of execution of P2, (10-5=5ms))
waiting time of Process, P3 = 16ms (P3 starts execution after completion of P2 and P4)
waiting time of Process, P2 = 23ms (P1 starts execution after completion of P2, P4 & P3)

Therefore, Average waiting time = (waiting time of (P1+P4+P3+P2) / 4)

(0 + 5 + 16 + 23) / 4 =44/4 = 11 milliseconds
Turn Around Time of Process, P2 =10ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P4 = 11ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 23ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P1 = 28ms (time spent in Ready Queue + Execution Time)

Therefore, Average Turn Around Time = (Turn Around Time of (P1+P4+P3 + P2) / 4)
(10+11+23+28) / 4 = 72/4 = 18 milliseconds
RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 38

Preemptive Scheduling:
➢Preemptive Scheduling is employed in systems, which implement preemptive multitasking model.
➢Every task/process in the ‘Ready’ queue gets a chance to execute.
➢When and how often each process gets a chance to execute is dependent on type of preemptive scheduling
algorithm used for scheduling tasks/processes.
➢The scheduler can preempt the currently executing task/process and select another task/process from ‘Ready’ queue
for execution.
➢The task which is preempted by the scheduler goes to ‘Ready’ queue, this act without the process requesting for it –
‘Preemption’
➢The Preemptive scheduling can be implemented in different approaches. The two important approaches being Time-
Based Preemption and Priority Based Preemption.
➢The various types of Preemptive scheduling adopted in task/process scheduling are:
Preemptive Shortest Job First (SJF)/shortest Remaining Time(SRT) Scheduling
Round Robin (RR) Scheduling
Priority Based Scheduling

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 39

Preemptive SJF Scheduling/Shortest Remaining Time(SRT):

➢Sorts the ‘Ready’ queue when a new process enters the ‘Ready’ queue and checks whether the execution time of the
new process is shorter than the remaining of the total estimated time for the currently executing process.
➢If the execution time of the new process is less, the currently executed process is preempted and new process is
scheduled for execution.
➢Thus preemptive SJF scheduling always compares the execution time of the new process entering the ‘Ready’
queue with the remaining time for completion of the currently executing process and schedules the process with
shortest remaining time for execution. – Shortest Remaining First Scheduling.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 40

waiting time of Process, P2 = 0ms + (4-2)ms = 2ms (P2 starts execution first but interrupted by P4 and has to
wait till P4 completes execution )
waiting time of Process,P4 = 0ms (P4 is scheduled as soon as it enters the ‘Ready’ queue
waiting time of Process, P3 = 7ms (P3 starts execution after completion of P2 and P4)
waiting time of Process, P1 = 14ms (P1 starts execution after completion of P2, P4 & P3)

Therefore, Average waiting time = (waiting time of (P2+P4+P3+P1) / 4)

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 43

Round Robin (RR)Scheduling:

➢It is similar to FCFS scheduling and only difference is that

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 43

Round Robin (RR)Scheduling:

➢Round Robin Scheduling ensures that every process

gets a fixed amount of CPU time for execution.
➢When the process gets the fixed amount of CPU time is
determined by FCFS policy.
➢If a process terminates before the elapse of time slice,
the process releases the CPU voluntarily and the next
process in the queue is scheduled for execution by the
scheduler.
➢RR scheduling with interrupts is a good choice for
designing Real Time Embedded systems.
➢RR can also be used as technique for resolving the
priority in scheduling among the tasks with same level of
priority. Round Robin Scheduling

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 44

Round Robin (RR)Scheduling:

➢Round Robin Scheduling ensures that every process

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 44

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads
0000
Multiprocessing and Multitasking Task scheduling
Multiprocessing and Multitasking Task scheduling How to choose an RTOS.
Example 1:
Three processes with process IDs P1,P2 and P3 with estimated completion time 6,4,2 milliseconds respectively enters the ready queue
together in order P1, P2, P3. Calculate the waiting time and Turn Around Time(TAT) for each process and the average waiting time
and average Turn Around Time(Assuming there is no I/O waiting for the Processes.) in Round Robin scheduling with time slice 2ms.
The scheduler sorts the ‘Ready’ queue and picks up process, P1 first
and executes it for 2ms. When time slice expires, next process, P2 is P1 P2 P3 P1 P2 P1
scheduled for execution. The time slice expires after 2ms of execution
of P2. Then P2 is preempted and P3 is scheduled. After 2ms of 0 2 4 6 8 10 12
execution time slice expires, also P3 completes its execution. Then the
first process is scheduled again and so on. The order in which the 2 2 2 2 2 2
processes are scheduled for execution is represented as :
The waiting time for all processes is given by:
waiting time of Process, P1 = 6 ms (P1 starts execution first(0ms) & then waits for 2 time slices(4ms) & later 1 time slice(2ms))
waiting time of Process, P2 = 6 ms (P2 starts execution after completion 1 time slice(2ms) and later 2 time slices(4ms))
waiting time of Process, P3 = 4 ms (P2 starts execution after completion 2 time slice(4ms))

Therefore, Average waiting time = (waiting time of (P1+P2+P3) / 3)

(6 + 6 +4) / 3 = 16/3 = 5.33 milliseconds

Turn Around Time of Process, P1= 12ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P2 = 10ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 6ms (time spent in Ready Queue + Execution Time)

Therefore, Average Turn Around Time = (Turn Around Time of (P1+P2+P3) / 3)

(12 + 10 +6) / 3 = 28/3 = 9.33 milliseconds

RR scheduling involves lot of overhead in maintaining the time slice information for every process which is currently being executed.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 45

Priority Based Scheduling:

➢In Priority based Preemptive scheduling, any high priority process entering the ‘Ready’ queue is immediately
scheduled for execution whereas in non-preemptive scheduling any high priority process entering the ‘Ready’ queue
is scheduled only after completion of currently executing task or voluntarily relinquishes the CPU.
➢Priority of a task/process is indicated is same way as that of the mechanisms adopted for non-preemptive
multitasking.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 46

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads
0000
Multiprocessing and Multitasking Task scheduling
Multiprocessing and Multitasking Task scheduling How to choose an RTOS.
Example 1:
Three processes with process IDs P1,P2 and P3 with estimated completion time 10,5,7 milliseconds and priority 1,3,2( 0-highest and 3 lowest
priority) respectively enters the ready queue together. Calculate the waiting time and Turn Around Time(TAT) for each process and the
average waiting time and average Turn Around Time(Assuming there is no I/O waiting for the Processes.) in Priority Based Scheduling, if
a new process, P4 with estimated completion time 6 ms and priority 0 enters the ‘Ready’ queue after 5 ms of execution of process, P1.
At the beginning there are only 3 processes(P,1.P2,P3) in the ‘Ready’
queue, Scheduler picks up P1 process as it has highest Priority. Now P1 P4 P1 P3 P2
process P4 with estimated completion time 6ms and priority 0 enters
the ‘Ready’ queue after 5ms of start of execution of P1, since its 0 5 11 16 23 28
preemptive scheduling and P4 has higher priority over P1, P1will be
preempted an d P4 will be scheduled. After P4 completes its execution 5 6 5 7 5
P1(Process with highest priority) will be scheduled and so on.
waiting time of Process, P1 = 6ms (P1 starts execution first but later preempted and waits 6ms for P4 to complete)
waiting time of Process,P4 = 0ms (P4 starts execution, immediately after entering the ‘Ready queue)
waiting time of Process, P3 = 16ms (P3 starts execution after completion of P1 and P4)
waiting time of Process, P2 = 23ms (P2 starts execution after completion of P1, P4 & P3)
Therefore, Average waiting time = (waiting time of (P1+P4+P3+P2) / 4)
(6 + 0 + 16 + 23) / 4 =45/4 = 11.25 milliseconds
Turn Around Time of Process, P1 =16ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P4 = 06ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P3 = 23ms (time spent in Ready Queue + Execution Time)
Turn Around Time of Process, P2 = 28ms (time spent in Ready Queue + Execution Time)

Therefore, Average Turn Around Time = (Turn Around Time of (P1+P4+P3 + P2) / 4)
(16+6+23+28) / 4 = 73/4 = 18.25 milliseconds

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 47

Analysis:
Preemptive Priority based Scheduling is adopted in systems which demand ‘Real time’ behavior.

Major Drawbacks are:

➢Suffers Starvation and this can be come over by Aging.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 48

Functional Requirements:
1. Processor Support:
➢it is necessary that all RTOS’s support all kinds of Processor architecture.
2. Memory Requirements:
➢OS requires ROM memory for holding OS files and it is normally stored in non-volatile memory like FLASH.
➢OS also requires working memory RAM for loading the OS services.
➢Since embedded systems are memory constrained, it is essential to evaluate the minimal ROM and RAM
requirements for the OS under consideration.
3. Real time capabilities:
➢it is mandatory that OS for all embedded system are to be Real-time as all Embedded Systems are Real time in
behavior.
4. Kernel and interrupt latency:
➢The kernel of OS may disable interrupts while executing certain services and it may lead to interrupt latency.
➢For embedded system whose response requirement are high, this latency must be minimal.

5. Inter-Process Communication and Synchronization:

➢It is OS kernel dependent.
➢Certain OSs may provide bunch of options whereas others provide very limited options.
➢Certain kernels implement policies for avoiding priority inversion issues in resource sharing.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 49

Functional Requirements: contd.

6. Modularization Support:
➢Most of the OSs provides a bunch of features.
➢At times all of these features of OS may not be necessary for an embedded product for its functioning.
➢It is very useful if OS supports modularization where in the developer can choose the essential modules and
recompile the OS image for functioning.
➢Windows CE is an example for highly modular OS.

7. Support for Networking and communication:

➢the OS kernel may provide stack implementation and driver support for bunch of communication interfaces and
networking.
➢Ensure that OS under consideration provides support for all interfaces required by the embedded product.

8. Development Language Support:

➢Certain OS include the run time libraries required for running applications written in languages like Java and C#.
➢A Java Virtual Machine (JVM) customized for OS is essential for running java applications.
➢Similarly .NET Compact Framework (.NETCF) is required for running Microsoft .NET applications on top of
OS.
➢OS may include these as built-in components, if not check the availability of the same from third party vendor
for the OS under consideration.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 50

Operating System basics Types of operating systems Task, process and threads
Operating System basics Types of operating systems Task, process and threads
Multiprocessing and Multitasking Task scheduling How to choose an RTOS
Multiprocessing and Multitasking Task scheduling How to choose an RTOS.
Non-Functional Requirements:
1. Custom developed or off the shelf
➢Depending on OS requirement, it is possible to go for the complete development of an OS suiting embedded system needs or use an
off the shelf, readily available OS, which is either commercial product or open source product, which is in close match with OS
requirements.
➢Sometimes it may be possible to build the required features by customizing an Open Source OS.
➢The decision on which to select is purely dependent on the development cost, licensing fees for OS, development time and
availability of skilled resource.

2. Cost:
➢the total cost for developing or buying OS and maintaining it in terms of commercial product and custom build needs to be evaluated
before taking decision on selection of OS

3. Development and Debugging Tools ability:

➢Availability of development and debugging tools is a critical decision making factor in the selection of an OS for embedded design
➢Certain OS may be superior in performance, but availability of tools for supporting development may be limited.
➢Explore the different tools available for OS under consideration.

4. Ease of use:
➢How easy it is to use a commercial RTOS
5. After sales:
➢For commercial embedded RTOS, in the form of e-mail, on-call services etc. for bug fixes, critical patch updates and support for
production issues etc. should be thoroughly analyzed.

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 51

Reference

Shibu K V, “Introduction to Embedded

Systems”, First Edition, Tata McGraw Hill
Education Private Limited, 2009

RTOS for Embedded System Design

Prepared by Prof. Anand H. D., Dept. of ECE, Dr. AIT, Bengaluru-56 52

123
124
125
Prof. Anand H. D.
M. Tech. (PhD.)
Assistant Professor,
Department of Electronics & Communication Engineering
Dr. Ambedkar Institute of Technology, Bengaluru-56
Email: [email protected]
Phone: 9844518832
126
Prof. Anand H. D.
M. Tech. (PhD.)
Assistant Professor,
Department of Electronics & Communication Engineering
Dr. Ambedkar Institute of Technology, Bengaluru-56
Email: [email protected]
Phone: 9844518832
127
Prof. Anand H. D.
M. Tech. (PhD.)
Assistant Professor,
Department of Electronics & Communication Engineering
Dr. Ambedkar Institute of Technology, Bengaluru-56
Email: [email protected]
Phone: 9844518832
128

RTOS Based Embedded System Design
No ratings yet
RTOS Based Embedded System Design
16 pages
ES 2023 L6 Embedded System Interfacing RTOS
No ratings yet
ES 2023 L6 Embedded System Interfacing RTOS
13 pages
Es Module 4
No ratings yet
Es Module 4
29 pages
CHP4 Notes
No ratings yet
CHP4 Notes
5 pages
RTOS
No ratings yet
RTOS
61 pages
Rtos Avr V3i1 Ijertv3is10873
No ratings yet
Rtos Avr V3i1 Ijertv3is10873
4 pages
Embedded Systems RTOS
No ratings yet
Embedded Systems RTOS
47 pages
Module5 AMES
No ratings yet
Module5 AMES
88 pages
Rtos PDF
No ratings yet
Rtos PDF
12 pages
PE-EC 703 Embedded system
No ratings yet
PE-EC 703 Embedded system
51 pages
Module 5
No ratings yet
Module 5
22 pages
Embedded Esd 5 Unit
No ratings yet
Embedded Esd 5 Unit
18 pages
01 Sb 072010004900064
No ratings yet
01 Sb 072010004900064
96 pages
Real Time Operating System
No ratings yet
Real Time Operating System
51 pages
RTOS1-Introduction To RTOS
No ratings yet
RTOS1-Introduction To RTOS
16 pages
Real Time Operating Systems
No ratings yet
Real Time Operating Systems
23 pages
Rtos and Ide For Embedded System Design: Roopesh Kumar B N, Assistant Professor, Cse, Ksit
No ratings yet
Rtos and Ide For Embedded System Design: Roopesh Kumar B N, Assistant Professor, Cse, Ksit
72 pages
Es Case Study
No ratings yet
Es Case Study
4 pages
How To Choose A Real Time Operating System (Micro Controller and Embedded System, Computer Science and Engineering, Vtu)
No ratings yet
How To Choose A Real Time Operating System (Micro Controller and Embedded System, Computer Science and Engineering, Vtu)
18 pages
ES notes
No ratings yet
ES notes
44 pages
Rtos PDF
No ratings yet
Rtos PDF
12 pages
Need for Rtos (New)
No ratings yet
Need for Rtos (New)
17 pages
Real Time Operating System (RTOS)
No ratings yet
Real Time Operating System (RTOS)
27 pages
RTOS
No ratings yet
RTOS
16 pages
Mes Mod5
No ratings yet
Mes Mod5
72 pages
RTOS - Threads & Process
No ratings yet
RTOS - Threads & Process
20 pages
RTOS Based Embedded System Design
No ratings yet
RTOS Based Embedded System Design
192 pages
Real Time Operating System
No ratings yet
Real Time Operating System
9 pages
Embedded RTOS -2
No ratings yet
Embedded RTOS -2
114 pages
Embedded Systems Ch-4
No ratings yet
Embedded Systems Ch-4
35 pages
Simple Multitasking With Microcontrollers
No ratings yet
Simple Multitasking With Microcontrollers
4 pages
RTS
No ratings yet
RTS
32 pages
IES U-4 Final1
No ratings yet
IES U-4 Final1
25 pages
Real-Time Operating Systems RTOS
No ratings yet
Real-Time Operating Systems RTOS
38 pages
Mes p2 Module5
No ratings yet
Mes p2 Module5
13 pages
Unit 5
100% (1)
Unit 5
70 pages
ERTOS Chapter 4
No ratings yet
ERTOS Chapter 4
51 pages
WINSEM2023-24 BCSE305L TH VL2023240501060 2024-03-22 Reference-Material-I
No ratings yet
WINSEM2023-24 BCSE305L TH VL2023240501060 2024-03-22 Reference-Material-I
50 pages
Embedded Operating System and Representation
No ratings yet
Embedded Operating System and Representation
17 pages
Embedded System
No ratings yet
Embedded System
7 pages
RTOS New
No ratings yet
RTOS New
67 pages
Submitted by P. Manojkumar Ii D.C.E Sri Durga Devi Polytechnic College Chennai
No ratings yet
Submitted by P. Manojkumar Ii D.C.E Sri Durga Devi Polytechnic College Chennai
15 pages
Unit2 Classnotes
No ratings yet
Unit2 Classnotes
77 pages
Embedded System and Design (Theory Notes) Autonomous Course: Department OF Electronics & Communication Engineering
No ratings yet
Embedded System and Design (Theory Notes) Autonomous Course: Department OF Electronics & Communication Engineering
24 pages
06 - Rtos Eos-Concise
No ratings yet
06 - Rtos Eos-Concise
22 pages
4_Real-time_Operating_System[1]
No ratings yet
4_Real-time_Operating_System[1]
36 pages
Unit Iv Rtos Based Embedded System Design
100% (1)
Unit Iv Rtos Based Embedded System Design
11 pages
Embedded Systems Ch-4
No ratings yet
Embedded Systems Ch-4
35 pages
Topic8 RTOS-Intro Mco556
No ratings yet
Topic8 RTOS-Intro Mco556
27 pages
Embedded System: Real-Time Operating Systems
100% (1)
Embedded System: Real-Time Operating Systems
44 pages
5 3
100% (1)
5 3
34 pages
Rtos
No ratings yet
Rtos
11 pages
21CS43 Module 5 Microcontroller and Embedded Systems Prof VANARASAN
No ratings yet
21CS43 Module 5 Microcontroller and Embedded Systems Prof VANARASAN
41 pages
RTOS
No ratings yet
RTOS
3 pages
PPT ES-1
No ratings yet
PPT ES-1
22 pages
Module 5.2 Notes - RTOS
No ratings yet
Module 5.2 Notes - RTOS
6 pages
Real Time Operating Systems - MicroC - OS-II
No ratings yet
Real Time Operating Systems - MicroC - OS-II
84 pages
Real Time Operating System
No ratings yet
Real Time Operating System
15 pages
Operating System Interview Questions and Answers
From Everand
Operating System Interview Questions and Answers
Manish Soni
No ratings yet
Operating Systems: Concepts to Save Money, Time, and Frustration
From Everand
Operating Systems: Concepts to Save Money, Time, and Frustration
Jonathan Rigdon
No ratings yet
Unit 4 Databasedesign: Functional Dependencies and Normalization Informal Design Guidelines For Relation Schemas
No ratings yet
Unit 4 Databasedesign: Functional Dependencies and Normalization Informal Design Guidelines For Relation Schemas
24 pages
Instructions To The Candidates I. Answer Five Full Questions
No ratings yet
Instructions To The Candidates I. Answer Five Full Questions
3 pages
Pcs 3
No ratings yet
Pcs 3
2 pages
Power Electronics and Instrumentation: (Model Question Paper-01)
No ratings yet
Power Electronics and Instrumentation: (Model Question Paper-01)
2 pages
Um2650 The Stusb4500 Software Programing Guide Stmicroelectronics
No ratings yet
Um2650 The Stusb4500 Software Programing Guide Stmicroelectronics
45 pages
XPT2046
No ratings yet
XPT2046
30 pages
IPC With SPC300 - Step5 - K95 TAI LIEU SPC MOI PDF
No ratings yet
IPC With SPC300 - Step5 - K95 TAI LIEU SPC MOI PDF
7 pages
Micro Lec Note1
No ratings yet
Micro Lec Note1
118 pages
SparkFun 9DoF Razor IMU M0 PDF
No ratings yet
SparkFun 9DoF Razor IMU M0 PDF
15 pages
MSM BSM2G Ba Uk 000
No ratings yet
MSM BSM2G Ba Uk 000
35 pages
8085 Viva-Voice
No ratings yet
8085 Viva-Voice
3 pages
R5F364A6NFA Renesas
No ratings yet
R5F364A6NFA Renesas
92 pages
EENG4307Spring2025SyllabusCourseOutline
No ratings yet
EENG4307Spring2025SyllabusCourseOutline
8 pages
Design and Implementation of a Progrmmable Rain Detector with Alert System
No ratings yet
Design and Implementation of a Progrmmable Rain Detector with Alert System
16 pages
8085 Interupts
No ratings yet
8085 Interupts
13 pages
V850 Family: Product Letter Description
No ratings yet
V850 Family: Product Letter Description
4 pages
Patt Patel CH 08
No ratings yet
Patt Patel CH 08
23 pages
9691 w15 Ms Complete
No ratings yet
9691 w15 Ms Complete
85 pages
BCS302 Previous year Question paper with Answer
No ratings yet
BCS302 Previous year Question paper with Answer
25 pages
Gadget Rmnet
No ratings yet
Gadget Rmnet
3 pages
Em 78 P 153 SN
No ratings yet
Em 78 P 153 SN
53 pages
8085 MCQ
No ratings yet
8085 MCQ
20 pages
8085 Microprocessor
No ratings yet
8085 Microprocessor
20 pages
5.4 Cpu 928B: Cpus, Memory Cards, Memory Submodules, Interface Submodules
No ratings yet
5.4 Cpu 928B: Cpus, Memory Cards, Memory Submodules, Interface Submodules
12 pages
Gfk-2950g - Pacs Cpu Progrefmanual
No ratings yet
Gfk-2950g - Pacs Cpu Progrefmanual
500 pages
VLSI Design & Embedded Systems-Compressed
No ratings yet
VLSI Design & Embedded Systems-Compressed
79 pages
Tiva C Series LaunchPad
No ratings yet
Tiva C Series LaunchPad
127 pages
Microprocessors & Microcontrollers
No ratings yet
Microprocessors & Microcontrollers
12 pages
TMS 320C 54x - DSP Functional Overview
No ratings yet
TMS 320C 54x - DSP Functional Overview
52 pages
MCQS On Real Time Systems (6 Sem, CSE) : Prepared By: Sandigdha Acharya, Asst - Prof (CSE)
No ratings yet
MCQS On Real Time Systems (6 Sem, CSE) : Prepared By: Sandigdha Acharya, Asst - Prof (CSE)
12 pages
CPU IOP Communication
0% (4)
CPU IOP Communication
8 pages
FD432 Series Kinco Spec Sheet
No ratings yet
FD432 Series Kinco Spec Sheet
5 pages
Chapter 4 - Software PDF - Compressed
No ratings yet
Chapter 4 - Software PDF - Compressed
108 pages
8051 Microcontroller: Chapter - 2
No ratings yet
8051 Microcontroller: Chapter - 2
58 pages