Distributing criticality across ada partitions

• Published in: Lecture notes in computer science pp. 196 - 207
• Main Authors: Masmano, Miguel, Real, Jorge, Crespo, Alfons, Ripoll, Ismael
• Format: Conference Proceeding Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer-Verlag 01.01.2005; Springer Berlin Heidelberg; Springer
• Series: ACM Other Conferences
• Subjects: Applied sciences; Busy Cycle; Computer science; control theory; systems; Exact sciences and technology; Hard Partition; Hard Task; Kernel Space; Programming languages; Pulse Width Modulation Control; Software; Software development; Priority; Deadline; Linux system; Distributed system; Real time; Time response; Timed system; Real time system; Response time; Time average; UNIX system; ADA language; Occupation time; Reliability; Criticality; Execution time
• ISBN: 3540262865; 9783540262862
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11499909_16

A number of real-time systems combine strict (hard) and non strict (soft) timing requirements. In such systems, the hard timing requirements must be guaranteed, whereas tasks with soft requirements may miss some deadlines with no harmful consequences. One possibility to organise such systems is to run the critical tasks in the kernel space, at the highest priority available, while executing the soft tasks in user space, where they will use the remaining execution time after servicing the hard tasks. A recently produced porting of Ada to Real-Time Linux makes this architecture feasible. In this paper we propose a method for splitting a hard/soft real-time application into criticality-based partitions: the hard partition will run on RTLinux and the soft partition (or partitions) will be placed in the user space of Linux. The use of the Distributed System Annex enables the programmer to automatically place each partition in the right space and allows to hide the communication details between partitions. We also outline a strategy to reduce the average response time of soft tasks.