par Fisher, Nathan;Goossens, Joël 
;Baruah, Sanjoy
Référence Real-time systems, 45, 1-2, page (26-71)
Publication Publié, 2010-03-10
;Baruah, SanjoyRéférence Real-time systems, 45, 1-2, page (26-71)
Publication Publié, 2010-03-10
Article révisé par les pairs
| Résumé : | Optimal online scheduling algorithms are known for sporadic task systems scheduled upon a single processor. Additionally, optimal online scheduling algorithms are also known for restricted subclasses of sporadic task systems upon an identical multiprocessor platform. The research reported in this article addresses the question of existence of optimal online multiprocessor scheduling algorithms for general sporadic task systems. Our main result is a proof of the impossibility of optimal online scheduling for sporadic task systems upon a system comprised of two or more processors. The result is shown by finding a sporadic task system that is feasible on a multiprocessor platform that cannot be correctly scheduled by any possible online, deterministic scheduling algorithm. Since the sporadic task model is a subclass of many more general real-time task models, the nonexistence of optimal scheduling algorithms for the sporadic task systems implies nonexistence for any model which generalizes the sporadic task model. |
