de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Feasibility Analysis of Sporadic Real-time Multiprocessor Task Systems

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44160

Bonifaci,  Vincenzo
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bonifaci, V., & Marchetti-Spaccamela, A. (2010). Feasibility Analysis of Sporadic Real-time Multiprocessor Task Systems. In M. de Berg, & U. Meyer (Eds.), Algorithms - ESA 2010 (pp. 230-241). Berlin: Springer. doi:10.1007/978-3-642-15781-3_20.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1656-C
Abstract
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving an open problem in the area of multiprocessor real-time scheduling~[S.~Baruah and K.~Pruhs, Journal of Scheduling, 2009]. We also investigate the related notion of schedulability and a notion that we call online feasibility. Finally, we show that discrete-time schedules are as powerful as continuous-time schedules, which answers another open question in the above mentioned survey.