A recent result in [13] has demonstrated the existence of a sufficient global EDF schedulability test for sporadic task systems that makes the following guarantee: any task system...
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto March...
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...
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...