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.
Bonifaci, V., Marchetti-Spaccamela, A. (2012). Feasibility analysis of sporadic real-time multiprocessor task systems. ALGORITHMICA, 63(4), 763-780 [10.1007/s00453-011-9505-6].
Feasibility analysis of sporadic real-time multiprocessor task systems
Bonifaci V.
;
2012-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 (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 | |
|---|---|---|---|
|
sporadic-bm-algo.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
DRM non definito
Dimensione
365.27 kB
Formato
Adobe PDF
|
365.27 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
