A Survey of Parallel Hard-Real Time Scheduling on Task Models and Scheduling Approaches
Konferenz: ARCS 2017 - 30th International Conference on Architecture of Computing Systems
03.04.2017 - 06.04.2017 in Vienna, Austria
Tagungsband: ARCS 2017
Seiten: 8Sprache: EnglischTyp: PDFPersönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt
Langer, Tobias; Osinski, Lukas; Mottok, Juergen (Laboratory of Safe and Secure Systems – LaS3, University of Applied Sciences Regensburg, Germany)
The trend towards multi-core systems becomes increasingly omnipresent and has already reached hard real-time systems. In the recent years more and more researchers tackle the problem of scheduling parallel tasks with real-time constraints. We present a discussion of these recent approaches to hard real-time scheduling tasks consisting of multiple threads. We identify categories in scheduling mechanisms and task systems and discuss their features, as well as the research already achieved in their fields. In the domain of task models we identified the gang constrained task model, the order constrained task model and the unconstrained task model. These task models differ regarding the amount and type of thread execution constraints, which can be expressed using the model. Regarding scheduling algorithms, we identified transformation based and non-transformation based scheduling schemes. The former rely on off-line task transformation, whereas the latter doesn't require any prior information about task structures. The presented classifications show, that applied scheduling algorithms mostly are not restricted to certain task models, but that they are applied quite independently.