Paper Info
Title
MP1: real time scheduling theory and its use with ada
Abstract
This tutorial assumes basic knowledge or experience with the Ada programming language. Basic understanding of tasking and real-time constraints -- at the level of tutorial MA1 -- would be helpful. We assume that attendees have a minimal background on real time operating systems, Ada tasking and critical real time applications/systems; however, a (very) short presentation of such topics will be included in the tutorial. This tutorial deals with real time scheduling theory and its use with Ada. Real time scheduling theory was firstly proposed in 1974, but stays mostly unused by many software designers. Too many practitioners have no background on real time scheduling. This tutorial should help them to understand the basis of such a theory and to apply it with Ada technologies. This tutorial is expected to help Ada engineers to predict the performances of their critical Ada real time applications. This tutorial will be organized in three parts: 1. First, we define what a real time system is and then, the theoretical results of the real time scheduling theory are presented. The basic task models and schedulers are explained (their behavior and their properties). The tutorial focusses on fixed priority scheduler and its feasibility tests (eg. Rate monotonic and worst case task response time) which is the most useful scheduler with current real-life applications. However, a dynamic priority scheduler is also presented (eg. EDF). At the end of this first part, attendees should understand what a feasibility test is and how it can help them to predict performances of their real time applications. This part is ended with a short introduction on shared resource support (eg. what a priority inversion is, how PIP/PCP work). 2. Second, we show how real time scheduling features are taken into account in Ada international standards such as ISO/IEC Ada 1995 and 2005, the POSIX 1003 Ada binding and ARINC 653 (which is an avionic operating system standard providing an Ada binding). In this part, we try to show the relationships between the real time scheduling theory and the implementation of real time schedulers into practical systems. 3. Finally, some Ada program examples are presented and explained.
Year
DOI
Venue
2007
10.1145/1315580.1315588
SIGAda
Keywords
Field
DocType
real time schedulers,real time scheduling,real time application,ada engineer,ada international standard,critical real time application,real time scheduling theory,real time system,real time scheduling feature,real time operating system,real time,programming language,real time systems,software design,operating system,internal standard
Fixed-priority pre-emptive scheduling,Ada,Programming language,Scheduling (computing),Computer science,ARINC 653,Real-time computing,Real-time operating system,Priority inversion,Dynamic priority scheduling,Earliest deadline first scheduling
Conference
Volume
Issue
ISSN
XXVII
3
1094-3641
Citations 
PageRank 
References 
0
0.34
1
Authors
1
Name
Order
Citations
PageRank
Frank Singhoff19317.70