Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Feasibility Analysis of Sporadic Real-time Multiprocessor Task Systems


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

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

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: https://hdl.handle.net/11858/00-001M-0000-000F-1656-C
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.