Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
- Cite this paper as:
- Bonifaci V., Marchetti-Spaccamela A. (2010) Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. In: de Berg M., Meyer U. (eds) Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, vol 6347. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.