The Federated Scheduling of Systems of Mixed-Criticality Sporadic DAG Tasks

Sanjoy Baruah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

41 Scopus citations

Abstract

Under the federated approach to multiprocessor scheduling, each individual task is either restricted to execute upon a single processor (as in partitioned scheduling), or has exclusive access to all the processors upon which it may execute. The federated scheduling of a mixed-criticality collection of independent recurrent tasks is studied here. A model is proposed for mixed-criticality recurrent tasks that extends the (previously-proposed) implicit-deadline sporadic DAG tasks model to account for mixed criticalities. A federated scheduling algorithm for systems of such tasks is presented and proved correct, and a quantitative evaluation of its efficacy derived via the widely-used speedup factor metric.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE Real-Time Systems Symposium, RTSS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages227-236
Number of pages10
ISBN (Electronic)9781509053025
DOIs
StatePublished - Jul 2 2016
Event2016 IEEE Real-Time Systems Symposium, RTSS 2016 - Porto, Portugal
Duration: Nov 29 2016Dec 2 2016

Publication series

NameProceedings - Real-Time Systems Symposium
Volume0
ISSN (Print)1052-8725

Conference

Conference2016 IEEE Real-Time Systems Symposium, RTSS 2016
Country/TerritoryPortugal
CityPorto
Period11/29/1612/2/16

Keywords

  • dual criticalities
  • implicit deadlines
  • Multiprocessor scheduling
  • recurrent tasks
  • speedup bounds

Fingerprint

Dive into the research topics of 'The Federated Scheduling of Systems of Mixed-Criticality Sporadic DAG Tasks'. Together they form a unique fingerprint.

Cite this