Resource reclaiming schemes are applied in reservation-based real-time uniprocessor systems to support efficient reclaiming and sharing of computational resources left unused by early completing tasks, improving the response times of aperiodic and soft tasks in the presence of overruns. In this paper, we introduce algorithm M-CASH, a new efficient reclaiming scheme for multiprocessor platforms. M-CASH leverages the resource reservation approach offered by the Multiprocessor CBS server offering significant improvements. The correctness of the algorithm is formally proven and its performance is experimentally evaluated through several synthetic simulations
International audienceThis paper presents a new strategy for scheduling soft real-time tasks on mult...
Multiple processes may contend for shared resources such as variables stored in the shared memory of...
In recent years multiprocessor architectures have become mainstream, and multi-core processors are f...
Resource reclaiming schemes are applied in reservationbased real-time uniprocessor systems to suppor...
The scheduling of tasks in multiprocessor real-time systems has attracted many researchers in the re...
Most real-time scheduling algorithms schedule tasks with regard to their worst case computation time...
Resource reclaiming refers to the problem of utilizing the resources left unused by a task when it e...
In a dynamic real-time environment, predictability needs to be provided in the face of unpredictable...
International audienceWhen integrating hard, soft and non-real-time tasks in general purpose operati...
When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is nece...
Among the issues in adaptive real time system is the efficiency of the scheduling algorithm to satis...
Multi-core platforms are becoming the dominant computing architecture for next generation embedded s...
This thesis addresses the problem of online multi-resource management in embedded real-time systems....
The fast evolution of multicore systems, combined with the need of sharing the same platform for ind...
AbstractRedundancy is incorporated in safety critical systems for dependability and in traditional r...
International audienceThis paper presents a new strategy for scheduling soft real-time tasks on mult...
Multiple processes may contend for shared resources such as variables stored in the shared memory of...
In recent years multiprocessor architectures have become mainstream, and multi-core processors are f...
Resource reclaiming schemes are applied in reservationbased real-time uniprocessor systems to suppor...
The scheduling of tasks in multiprocessor real-time systems has attracted many researchers in the re...
Most real-time scheduling algorithms schedule tasks with regard to their worst case computation time...
Resource reclaiming refers to the problem of utilizing the resources left unused by a task when it e...
In a dynamic real-time environment, predictability needs to be provided in the face of unpredictable...
International audienceWhen integrating hard, soft and non-real-time tasks in general purpose operati...
When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is nece...
Among the issues in adaptive real time system is the efficiency of the scheduling algorithm to satis...
Multi-core platforms are becoming the dominant computing architecture for next generation embedded s...
This thesis addresses the problem of online multi-resource management in embedded real-time systems....
The fast evolution of multicore systems, combined with the need of sharing the same platform for ind...
AbstractRedundancy is incorporated in safety critical systems for dependability and in traditional r...
International audienceThis paper presents a new strategy for scheduling soft real-time tasks on mult...
Multiple processes may contend for shared resources such as variables stored in the shared memory of...
In recent years multiprocessor architectures have become mainstream, and multi-core processors are f...