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

Authors:
Vincenzo Bonifaci;Alberto Marchetti-Spaccamela;Sebastian Stiller
Affiliations:
Max-Planck Institut für Informatik, Saarbrücken, Germany;Sapienza Università di Roma, Rome, Italy;Technische Universität Berlin, Berlin, Germany
Venue:
Algorithmica
Year:
2012

Citing 0
Cited 2

Assigning sporadic tasks to unrelated parallel machines

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Algorithms and complexity for periodic real-time scheduling

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We devise an approximate feasibility test for multiprocessor real-time scheduling in the sporadic task model. 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 not schedulable by any algorithm on m unit speed machines. This speedup bound is known to be the best possible for EDF. The running time of the algorithm is polynomial in the size of the task system and 1/ε. We also provide a generalized tight bound that trades off speed with additional machines.