Abstract—The functional consolidation induced by the costreduction trends in embedded systems can force tasks of different criticality (e.g. ABS Brakes with DVD) to share a proce...
Dionisio de Niz, Karthik Lakshmanan, Ragunathan Ra...
Current hard real-time scheduling and analysis techniques are unable to efficiently utilize the computational bandwidth provided by multicore platforms. This is due to the large ...
Malcolm S. Mollison, Jeremy P. Erickson, James H. ...
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
Irina Lupu, Pierre Courbin, Laurent George, Jo&eum...
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancin...
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...