http://www.cnr.it/ontology/cnr/individuo/prodotto/ID7591

Mixed-Criticality Scheduling of Sporadic Task Systems (Articolo in rivista)

Type

Label

Mixed-Criticality Scheduling of Sporadic Task Systems (Articolo in rivista) (literal)

Anno

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi

Alternative label

Baruah, S.; Bonifaci, V.; D'Angelo, G.; Marchetti Spaccamela, A.; van der Ster, S.; Stougie, L. (2011)
Mixed-Criticality Scheduling of Sporadic Task Systems
in Lecture notes in computer science
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Baruah, S.; Bonifaci, V.; D'Angelo, G.; Marchetti Spaccamela, A.; van der Ster, S.; Stougie, L. (literal)

Pagina inizio

Pagina fine

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

Rivista

Note

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

University of North Carolina, USA Max-Planck Institut fuer Informatik, Saarbruecken, Germany University of L'Aquila, Italy Sapienza University of Rome, Italy Vrije Universiteit Amsterdam and CWI, the Netherlands Vrije Universiteit Amsterdam and CWI, the Netherlands (literal)

Titolo

Abstract

We consider the scheduling of mixed-criticality task systems, that is, systems where each task to be scheduled has multiple levels of worst-case execution time estimates. We design a scheduling algorithm, EDF-VD, whose effectiveness we analyze using the processor speedup metric: we show that any 2-level task system that is schedulable on a unit-speed processor is correctly scheduled by EDF-VD using speed $\phi$; here $\phi < 1.619$ is the golden ratio. We also show how to generalize the algorithm to $K > 2$ criticality levels.We finally consider 2-level instances on m identical machines. We prove speedup bounds for scheduling an independent collection of jobs and for the partitioned scheduling of a 2-level task system. (literal)

Prodotto di

Autore CNR

Prodotto

Autore CNR di

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi

data.CNR.it