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.
Feasibility analysis of sporadic real-time multiprocessor task systems / Bonifaci, Vincenzo; MARCHETTI SPACCAMELA, Alberto. - STAMPA. - 6347 LNCS:PART 2(2010), pp. 230-241. (Intervento presentato al convegno 18th Annual European Symposium on Algorithms, ESA 2010 tenutosi a Liverpool nel 6 September 2010 through 8 September 2010) [10.1007/978-3-642-15781-3_20].
Feasibility analysis of sporadic real-time multiprocessor task systems
BONIFACI, VINCENZO;MARCHETTI SPACCAMELA, Alberto
2010
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2010_11573-215185.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
3.53 MB
Formato
Adobe PDF
|
3.53 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
