A polynomial-time approximation scheme (PTAS) is derived for the partitioned EDF scheduling of implicit-deadline sporadic task systems upon unrelated multiprocessor platforms that are comprised of a constant number of distinct types of processors. This generalizes earlier results showing the existence of polynomial-time approximation schemes for the partitioned EDF scheduling of implicit-deadline sporadic task systems on (1) identical multiprocessor platforms, and (2) unrelated multiprocessor platforms containing a constant number of processors. © 2012 Springer Science+Business Media New York.
Wiese, A., Bonifaci, V., Baruah, S. (2013). Partitioned EDF scheduling on a few types of unrelated multiprocessors. REAL-TIME SYSTEMS, 49(2), 219-238 [10.1007/s11241-012-9164-y].
Partitioned EDF scheduling on a few types of unrelated multiprocessors
Bonifaci V.;
2013-01-01
Abstract
A polynomial-time approximation scheme (PTAS) is derived for the partitioned EDF scheduling of implicit-deadline sporadic task systems upon unrelated multiprocessor platforms that are comprised of a constant number of distinct types of processors. This generalizes earlier results showing the existence of polynomial-time approximation schemes for the partitioned EDF scheduling of implicit-deadline sporadic task systems on (1) identical multiprocessor platforms, and (2) unrelated multiprocessor platforms containing a constant number of processors. © 2012 Springer Science+Business Media New York.| File | Dimensione | Formato | |
|---|---|---|---|
|
unrelated-rts.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
DRM non definito
Dimensione
245.89 kB
Formato
Adobe PDF
|
245.89 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
