Lect 6

Real-time Programming
RT Operating System
Features of Real-Time Kernels Most real-time systems do not provide the features found in a standard desktop system Reasons include Real-time systems are typically single-purpose Real-time systems often do not require interfacing with a user Features found in a desktop PC require more substantial hardware that what is typically available in a real-time system
2/33
6. RT Operating System
Virtual Memory in Real-Time Systems Address translation may occur via: (1) Real-addressing mode where programs generate actual addresses (2) Relocation register mode (3) Implementing full virtual memory
3/33
Page 1
Address Translation
4/33
Implementing Real-Time Systems
In general, real-time operating systems must provide: (1) Preemptive, priority-based scheduling (2) Preemptive kernels (3) Latency must be minimized
5/33
Minimizing Latency Event latency is the amount of time from when an event occurs to when it is serviced.
6/33
Page 2
Interrupt Latency Interrupt latency is the period of time from when an interrupt arrives at the CPU to when it is serviced
7/33
Dispatch Latency Dispatch latency is the amount of time required for the scheduler to stop one process and start another
8/33
Real-Time CPU Scheduling Periodic processes require the CPU at specified intervals (periods) p is the duration of the period d is the deadline by when the process must be serviced t is the processing time
9/33
Page 3
Scheduling of tasks when P2 has a higher priority than P1
10/33
Rate Montonic Scheduling
A priority is assigned based on the inverse of its period Shorter periods = higher priority; Longer periods = lower priority
P1 is assigned a higher priority than P2.
11/33
Missed Deadlines with Rate Monotonic Scheduling
12/33
Page 4
Earliest Deadline First Scheduling
Priorities are assigned according to deadlines: the earlier the deadline, the higher the priority; the later the deadline, the lower the priority
13/33
Proportional Share Scheduling
T shares are allocated among all processes in the system
An application receives N shares where N < T
This ensures each application will receive N / T of the total processor time
14/33
Pthread Scheduling
The Pthread API provides functions for managing real-time threads Pthreads defines two scheduling classes for real-time threads: (1) SCHED_FIFO - threads are scheduled using a FCFS strategy with a FIFO queue. There is no time-slicing for threads of equal priority (2) SCHED_RR - similar to SCHED_FIFO except time-slicing occurs for threads of equal priority
15/33
Page 5
VxWorks 5.0
16/33
Wind Microkernel
The Wind microkernel provides support for the following:
(1) Processes and threads (2) preemptive and non-preemptive round-robin scheduling (3) manages interrupts (with bounded interrupt and dispatch latency times) (4) shared memory and message passing interprocess communication facilities
17/33
Specifics of RT OS support for real time operations (timers), concurrency (task scheduling), ... deterministic timing behaviour, predictability
18/33
Page 6
Obstacles of Predictability direct memory access (DMA) DMA takes control of I/O I/O shares bus with CPU, DMA can block CPU (cycle stealing) caches, memory management (page faults, page replacements) interrupts system calls (what is the worst case execution time?)
19/33
Functionality basic services: task management interprocess communication and synchronization timers memory allocation device I/O supervision trade-off: more features, more complex, performance degradation, more dicult to analyze less features, better performance, easier to analyze
20/33
Task Scheduling typically based on priority based preemtive scheduling equal priority processes: FIFO, round-robin (time slicing) switch time should be load-independent
21/33
Page 7
Standards RT-POSIX OSEK Oene Systeme und deren Schnittstellen fr die Elektronik in Kraftfahrzeugen ("Open Systems and their interfaces for the Electronics in Motor vehicles"), founded in 1993 by a german automotive companies consortium APEX avionics standard ITRON Industrial TRON (The Real-time Operating System Nucleus), started 1984 in Japan, about 50 kernel products
22/33
Implementations commercial: VxWorks QNX OSE Linux-related: RTLINUX RTAI
23/33
RTLINUX
24/33
Page 8
Defects of Linux Linux scheduling algorithms are not designed for real-time tasks. Linux will batch operations to make more efficient use of the hardware. Linux scheduling is unpredictable. Linux processes are heavyweight processes. It can take several hundred microseconds to finish a context switch. Linux Timer resolution is coarse, 10 ms. Linux Kernel is Non-preemptible . Even the lowest priority task is running. Linux will make high priority tasks wait for low priority tasks to release resources. Linux disables interrupts used for coarse-grained synchronization. Coarse grained synchronization means that there are long intervals when one task has exclusive use of some data. Linux uses virtual memory. Linux reorders requests for efficiency (e.g., for disk I/O).
Real-time Programming 25/33 6. RT Operating System
RTLinux RT-Linux is an operating system in which a small real-time kernel coexists with the POSIX-like Linux kernel. RTLinux is module oriented. Scheduler. The earliest deadline first scheduler. Rate-monotonic scheduler. The module that implements RT-FIFOs. RTLinux decouples the mechanisms of the real-time kernel from the mechanisms of the general purpose kernel. Each can be optimized independently. The RT kernel can be kept small and simple.
26/33
Detail of the bare Linux Kernel

User Proccesses
System Libraries Device Drivers Unix/Linux Kernel
I/O
Hardware Interrupts
Hardware
27/33
Page 9
RTLinux Features
Real-time scheduling algorithm. Predictable delays.
By its small size and limited operations.
Finer timer resolution. Pre-emptible kernel.

The RTLinux executive is itself non pre-emptible. Its routine are very small and fast, this does not cause big delays. Interrupts from Linux are disabled.
No virtual memory.
28/33
Detail of RT Linux Kernel

User Proccesses
RT Tasks
System Libraries Device Drivers Unix/Linux Kernel
I/O
Software Interrupts
RT Scheduler
Direct Hardware Acess I/O Hardware Interrupts
29/33
Architecture of RT Application
User Processes
RT FIFO
RT FIFO
Linux Kernel
Real-time processes
Device
Device
RT Device
30/33
Page 10
Scheduler RT-Linux contains a dynamic scheduler. RT-Linux has many kinds of Schedulers.

FIFO. The earliest deadline first scheduler. Rate-monotonic scheduler.
31/33
RT FIFO Real-time FIFOs are used to pass information between real-time process and ordinary Linux process. Real-time FIFOs are designed to never block the real-time task. RT-FIFOs are, like real-time tasks, never paged out. This eliminates the problem of unpredictable delays due to paging.
32/33
Timer Resolution If the kernel was patched with UTIME, we could schedule processes with microsecond resolution. Running rtlinux-V3.0 Kernel 2.2.19 on the 486 allows stable hard real-time operation. Giving:

15 microseconds worst case jitter. 10 microseconds event resolution. 17 nanoseconds timer resolution. 6 microseconds interrupt response time. (This value was measured on interrupts on the parallel port)
High resolution timing functions give nanosecond resolution (limited by the hardware only.)
33/33
Page 11

Lect 6

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Lect 6

Hochgeladen von

Copyright:

Verfügbare Formate

Real-time Programming

Implementing Real-Time Systems

Scheduling of tasks when P2 has a higher priority than P1

Rate Montonic Scheduling

P1 is assigned a higher priority than P2.

Missed Deadlines with Rate Monotonic Scheduling

Earliest Deadline First Scheduling

Proportional Share Scheduling

T shares are allocated among all processes in the system

An application receives N shares where N < T

The Wind microkernel provides support for the following:

Implementations commercial: VxWorks QNX OSE Linux-related: RTLINUX RTAI

Detail of the bare Linux Kernel

System Libraries Device Drivers Unix/Linux Kernel

Real-time scheduling algorithm. Predictable delays.

By its small size and limited operations.

Finer timer resolution. Pre-emptible kernel.

Detail of RT Linux Kernel

FIFO. The earliest deadline first scheduler. Rate-monotonic scheduler.

Das könnte Ihnen auch gefallen