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 (Baruah and Pruhs in Journal of Scheduling 13(6):577-582, 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.
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems / Bonifaci, Vincenzo; MARCHETTI SPACCAMELA, Alberto. - In: ALGORITHMICA. - ISSN 0178-4617. - 63:4(2012), pp. 763-780. [10.1007/s00453-011-9505-6]
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
BONIFACI, VINCENZO;MARCHETTI SPACCAMELA, Alberto
2012
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 (Baruah and Pruhs in Journal of Scheduling 13(6):577-582, 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.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2012_11573-356920.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
638.42 kB
Formato
Adobe PDF
|
638.42 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
