A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly decides either that the task system can be scheduled using the earliest deadline first algorithm on m speed-(2 - 1/m + ) machines, or that the system is infeasible for m speed-1 machines. The running time of the algorithm is polynomial in the size of the task system and 1/. We also provide an improved bound trading off speed for additional machines. Our analysis relies on a new concept for counting the workload of an interval, that might also turn useful for analyzing other types of task systems.

• Type: Conference
• Year: 2008
• Where: ESA
• Authors: Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller
• Keywords: Algorithm, Algorithms, ESA 2008, Multiprocessor Real-time Scheduling, Task Systems