Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation

Contribution à l'analyse d'ordonnançabilité des applications temps-réel multiprocesseurs

Abstract : A real-time system is one whose logical correctness is based both on the correctness of the outputs and on their timeliness. It must satisfy explicit (bounded) response-time constraints or risks severe consequences, including system failure. Consequently, a key requirement for real-time systems is the end-to-end delay in task execution, a critical issue is the design and analysis of these time critical systems. Now, systems are increasingly complex, using several processors to process a large num- ber of tasks. Furthermore, the environment in which these systems are used is complex and evolving. For these reasons, we focus on the schedulabilty analysis of real-time ap- plications on multiprocessor platforms and on the scalability of these applications. In this regard we propose a new approach for fault-tolerant scheduling on multiprocessors with global preemptive EDF and Pfair policy. Our approach guarantees the comple- tion of a scheduled task before its deadline in the presence of a processor failure. It requires more results on schedulability theory on multiprocessors when complex tasks systems are considered. First, we address the cyclicity problem for global multiproces- sor scheduling. We propose a large class of scheduling strategies, the monotonous class and show how to characterize the beginning of the steady state. Then we show that most of the classical algorithms belong to this class. Then, we extend the notion of Pfairness to the context of asynchronous tasks with contrained deadlines. We investigate feasibil- ity conditions and we propose a rather efficient one. Finally, we consider the problem of aperiodic tasks with contrained deadline adjunction. We propose an acceptance pro- tocol, which relies on a fair distribution of the idle time units. The accepted aperiodic tasks are then scheduled in background. Next, we consider interacting periodic tasks. We still try to distribute the idle time units fairly. For that aim, we consider a model- driven approach, based on the modelling of the application by a Petri net and we propose extraction rules which can accommodate our acceptance protocol.
Document type :
Complete list of metadata

Cited literature [115 references]  Display  Hide  Download
Contributor : Bénédicte Carouge Connect in order to contact the contributor
Submitted on : Monday, January 10, 2011 - 3:04:56 PM
Last modification on : Wednesday, October 20, 2021 - 3:22:09 AM
Long-term archiving on: : Monday, April 11, 2011 - 3:14:35 AM


  • HAL Id : tel-00554234, version 1



Sadouanouan Malo. Contribution à l'analyse d'ordonnançabilité des applications temps-réel multiprocesseurs. Sciences de l'ingénieur [physics]. ISAE-ENSMA Ecole Nationale Supérieure de Mécanique et d'Aérotechique - Poitiers, 2010. Français. ⟨tel-00554234⟩



Record views


Files downloads