Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (Articolo in rivista)

Type
Label
  • Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (Articolo in rivista) (literal)
Anno
  • 2012-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/s00453-011-9505-6 (literal)
Alternative label
  • Bonifaci, V.; Marchetti Spaccamela A. (2012)
    Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
    in Algorithmica
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Bonifaci, V.; Marchetti Spaccamela A. (literal)
Pagina inizio
  • 763 (literal)
Pagina fine
  • 780 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 63 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 18 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 4 (literal)
Note
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Istituto di Analisi dei Sistemi ed Informatica - CNR, Rome, Italy Sapienza University of Rome, Italy (literal)
Titolo
  • Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (literal)
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. (literal)
Prodotto di
Autore CNR

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
data.CNR.it