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

Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Sebastian Stiller

not available

Scheduling; Real-Time Scheduling; Approximation Algorithms; Resource Augmentation

We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and e > 0, correctly decides either that the task system can be scheduled using the earliest deadline first algorithm on m speed-(2-1/m+e) 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/e. 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.

Download as [PDF]