Real Time Operating Systems for Networked Embedded Systems

Subhashis Banerjee Indian Institute of Technology Delhi

[email protected]
With: Soumyadeb Mitra, Nitin Rajput, M.Balakrishnan

well finally as we came to the end of our 2 day workshop...i cant help smiling...coz the best part was our team work...i wanted to mention all your names in our vote of thank session..but since time was running out...i had to skip it.. A big applause to our dynamic bachelors lukman,sreejith,emil and manu..for running b/w calicut town to mavoor and then to milma and then to railway station and so on and on....for arranging the lab sessions, for arranging the food for guests..(lukman with his camera)... Remya ad punitha did a great job in organizing our food session...thanks to remya,rithmi and neethu for ther table covers,glasses and what not... Good work by rithmi as our treasurer...we still have some money left... :) thanks to Rithmi and neethu for always being there ..they took good care of our guests.... our registration team did an awesome job...keerthi, anju,soumya...

Fire alarm system: an example

Central server
TCP/IP over radio

Controllers: ARM based

Low bandwidth radio links

Sensors: microcontroller based

Fire Alarm System

Problem

Hundreds of sensors, each fitted with Low Range Wireless

Sensor information to be logged in a server &

appropriate action initiated

Possible Solution

Collaborative Action
Routing

Dynamic Sensors/controllers may go down Auto Configurable No/easy human intervention. Less Collision/Link Clogging Less no of intermediate nodes Fast Response Time Secure

RTOS: Target Architectures

Processors
Microcontrollers ARM7 ARM9 Strong ARM Intel Xscale Mips4Kcore X86

MIPS
~20 100-133 180-250 206 400 400

Presentation Outline
Definitions Role of an OS in Real Time Systems Features of Real Time Operating Systems

Scheduling Resource Allocation Interrupt Handling Other Issues

Linux for Real Time Systems and RTLinux rtker Our own RTOS Other RTOSs

Real Time System

A system is said to be Real Time if it is required to complete its work & deliver its services on time. Example Flight Control System

All tasks in that system must execute on time.

Non Example PC system

Hard and Soft Real Time Systems

Hard Real Time System

Failure to meet deadlines is fatal example : Flight Control System Late completion of jobs is undesirable but not fatal. System performance degrades as more & more jobs miss deadlines Online Databases

Soft Real Time System

Qualitative Definition.

Hard and Soft Real Time Systems

(Operational Definition) Hard Real Time System

Validation by provably correct procedures or extensive simulation that the system always meets the timings constraints

Soft Real Time System

Demonstration of jobs meeting some statistical constraints suffices.

25 frames per second on an average

Example Multimedia System

Role of an OS in Real Time Systems

Standalone Applications

Often no OS involved Micro controller based Embedded Systems

Some Real Time Applications are huge & complex

Multiple threads Complicated Synchronization Requirements Filesystem / Network / Windowing support OS primitives reduce the software design time

Features of RTOSs
Scheduling. Resource Allocation.

Interrupt Handling. Other issues like kernel size.

Scheduling in RTOS
More information about the tasks are known

No of tasks Resource Requirements Release Time Execution time Deadlines

Being a more deterministic system better scheduling algorithms can be devised.

Scheduling Algorithms in RTOS

Clock Driven Scheduling Weighted Round Robin Scheduling

Priority Scheduling (Greedy / List / Event Driven)

Scheduling Algorithms in RTOS (contd)

Clock Driven

All parameters about jobs (release time/ execution time/deadline) known in advance. Schedule can be computed offline or at some regular time instances. Minimal runtime overhead. Not suitable for many applications.

Scheduling Algorithms in RTOS (contd)

Weighted Round Robin

Jobs scheduled in FIFO manner Time quantum given to jobs is proportional to its weight Example use : High speed switching network
QOS guarantee.

Not suitable for precedence constrained jobs.

Job A can run only after Job B. No point in giving time

quantum to Job B before Job A.

Scheduling Algorithms in RTOS (contd)

Priority Scheduling (Greedy/List/Event Driven)

Processor never left idle when there are ready tasks Processor allocated to processes according to priorities Priorities
static - at design time Dynamic - at runtime

Priority Scheduling
Earliest Deadline First (EDF)

Process with earliest deadline given highest priority slack = relative deadline execution left For periodic tasks Tasks priority inversely proportional to its period

Least Slack Time First (LSF)

Rate Monotonic Scheduling (RMS)

Resource Allocation in RTOS

Resource Allocation

The issues with scheduling applicable here. Resources can be allocated in

Weighted Round Robin Priority Based

Some resources are non preemptible

Example : semaphores

Priority Inversion if priority scheduling is used

Priority Inversion

Solutions to Priority Inversion

Non Blocking Critical Section

Higher priority Thread may get blocked by unrelated low priority thread Each resource has an assigned priority Priority of thread is the highest of all priorities of the resources its holding The thread holding a resource inherits the priority of the thread blocked on that resource

Priority Ceiling

Priority Inheritance

Other RTOS issues

Interrupt Latency should be very small

Kernel has to respond to real time events Interrupts should be disabled for minimum possible time

For embedded applications Kernel Size should be small

Should fit in ROM No Virtual Memory No Protection

Sophisticated features can be removed

Linux for Real Time Applications

Scheduling

Priority Driven Approach

Optimize average case response time

Interactive Processes Given Highest Priority

Aim to reduce response times of processes

Real Time Processes

Processes with high priority No notion of deadlines

Resource Allocation

No support for handling priority inversion

Interrupt Handling in Linux

Interrupts are disabled in ISR/critical sections of the kernel No worst case bound on interrupt latency avaliable

eg: Disk Drivers may disable interrupt for few hundred milliseconds Interrupts may be missed

Not suitable for Real Time Applications

Other Problems with Linux

Processes are non preemtible in Kernel Mode

System calls like fork take a lot of time High priority thread might wait for a low priority thread to complete its system call Context switch takes several hundred microseconds

Processes are heavy weight

Why Linux
Coexistence of Real Time Applications with non Real Time Ones

Example http server

Device Driver Base Stability

RTLinux
Real Time Kernel at the lowest level Linux Kernel is a low priority thread

Executed only when no real time tasks

Interrupts trapped by the Real Time Kernel and passed onto Linux Kernel

Software emulation to hardware interrupts

Interrupts are queued by RTLinux Software emulation to disable_interrupt()

RTLinux (contd)
Real Time Tasks

Statically allocate memory No address space protection

Non Real Time Tasks are developed in Linux Communication

Queues Shared memory

RTLinux Framework

rtker Our RTOS

Motivation

Our own OS
Full grasp over source code Easily modifiable, portable

Features

Modular Design
Isolation of Architecture/CPU dependent and

independent code Easy to Port

Pluggable Scheduler Two level Interrupt Handling Small footprint Oskits Device Driver Framework

Pluggable Scheduler
Scheduler - part of the Application Kernel interacts with the scheduler through an API Application developer needs to implement the scheduler API

Can optimize on Data Structures & Algorithms for implementing the scheduler

rtker Block Diagram

Two Level Interrupt Handling

Two level Interrupt Handling

Top Half Interrupt Handler

Called Immediately Kernel never disables interrupts Cannot invoke thread library functions - Race Conditions

Bottom Half Interrupt Handler

Invoked when kernel not in Critical Section Can invoke thread library functions

Very Low Response time (as compared to Linux)

Two Level Interrupt Handling

Other Features
Footprint

Small footprint (~50kb) Allows direct porting of existing drivers from Linux. Example Ethernet Driver of Linux

Oskits Device Driver Framework

Other RTOSs
LynxOS

Microkernel Architecture
Kernel provides scheduling/interrupt handling

Additional features through Kernel Plug Ins(KPIs)

TCP/IP stack , Filesystem KPIs are multithreaded

Memory Protection/ Demand Paging Optional Development and Deployment on the same host
OS support for compilers/debuggers

Other RTOSs (contd)

VxWorks

Monolithic Architecture Real Time Posix compliant Cross development System Object Oriented OS

pSOS

Peripheral devices and protocols

Interfacing
Serial/parallel ports, USB, I2C, PCMCIA, IDE Serial, Ethernet, Low bandwidth radio, IrDA, 802.11b based devices LCD, Keyboard, Touch sensors, Sound, Digital pads, Webcams A variety of sensors using fire, temperature, pressure, water level, seismic, sound, vision

Communication User Interface Sensors