Mixed-criticality scheduling on multiprocessors

Cited 36 time in webofscience Cited 0 time in scopus
  • Hit : 295
  • Download : 97
The scheduling of mixed-criticality implicit-deadline sporadic task systems on identical multiprocessor platforms is considered. Two approaches, one for global and another for partitioned scheduling, are described. Theoretical analyses and simulation experiments are used to compare the global and partitioned scheduling approaches.
Publisher
SPRINGER
Issue Date
2014-01
Language
English
Article Type
Article
Citation

REAL-TIME SYSTEMS, v.50, no.1, pp.142 - 177

ISSN
0922-6443
DOI
10.1007/s11241-013-9184-2
URI
http://hdl.handle.net/10203/188954
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 36 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0