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. © 2010 Springer-Verlag.
Bonifaci, V., Marchetti-Spaccamela, A. (2010). Feasibility analysis of sporadic real-time multiprocessor task systems. In Proc. 18th Annual European Symposium on Algorithms (pp.230-241). Berlin : Springer [10.1007/978-3-642-15781-3_20].
Feasibility analysis of sporadic real-time multiprocessor task systems
Bonifaci V.;
2010-01-01
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. © 2010 Springer-Verlag.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
