Graph-based models for real-time workload: a survey
2015 (English)In: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383, Vol. 51, no 5, 602-636 p.Article in journal (Refereed) Published
This paper provides a survey on task models to characterize real-time workloads at different levels of abstraction for the design and analysis of real-time systems. It covers the classic periodic and sporadic models by Liu and Layland et al., their extensions to describe recurring and branching structures as well as general graph- and automata-based models to allow modeling of complex structures such as mode switches, local loops and also global timing constraints. The focus is on the precise semantics of the various models and on the solutions and complexity results of the respective feasibilty and schedulability analysis problems for preemptable uniprocessors.
Place, publisher, year, edition, pages
2015. Vol. 51, no 5, 602-636 p.
Real-time scheduling, Scheduling theory, Schedulability test, Workload models, Survey
IdentifiersURN: urn:nbn:se:uu:diva-261947DOI: 10.1007/s11241-015-9234-zISI: 000359748300004OAI: oai:DiVA.org:uu-261947DiVA: diva2:852583