Titelaufnahme

Titel
A scheduling scheme extension of the Earliest Deadline First policy for hard real-time uniprocessor systems integrated on POSIX threads based on Linux / Vidblain Amaro-Ortega, Arnoldo Díaz-Ramírez, Brenda Leticia Flores-Rios, Félix Fernando González-Navarro, Frank Werner, Larysa Burtseva
VerfasserAmaro-Ortega, Vidblain ; Díaz-Ramírez, Arnoldo ; Flores-Rios, Brenda Leticia ; González-Navarro, Félix Fernando ; Werner, Frank ; Burtseva, Larysa
Erschienen[Magdeburg] : [Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik], [2016]
Umfang1 Online-Ressource (20 Seiten, 0,4 MB) : Illustrationen
Anmerkung
Literaturverzeichnis: Seite 16-17
Serienangabe der Homepage entnommen
SpracheEnglisch
SeriePreprints ; 2016,07
URNurn:nbn:de:gbv:3:2-71492 
Zugriffsbeschränkung
 Das Dokument ist frei verfügbar
Dateien
A scheduling scheme extension of the Earliest Deadline First policy for hard real-time uniprocessor systems integrated on POSIX threads based on Linux [0.4 mb]
Links
Nachweis
Kein Nachweis verfügbar
Klassifikation
Keywords
Abstract: In recent years Linux has been employed to execute numerous real-time applications. However it is limited to support soft real-time systems. For real-time systems with critical constraints the soft real-time support and the scheduling policies offered by Linux are still insufficient. In this work the Earliest Deadline First scheduling policy which has been shown in theory to be an optimal one in uniprocessor systems is introduced as an extension of the Linux kernel. This policy is implemented into the real-time class without the necessity of defining an additional class. The Linux kernel affords capabilities of a hard real-time operating system by an RT-Preempt patch enabling the use of Linux to implement hard real-time systems. The integration is compliant with the POSIX real-time and thread standards ensuring applications portability employing the GLIBC library. In order to validate the proposed implementation a set of experiments is conducted showing that a real-time system that cannot be feasibly scheduled using existing policies attains feasibility when it is scheduled using the integrated Earliest Deadline First policy.