Suspension-Aware Earliest-Deadline-First Scheduling Analysis

While the earliest-deadline-first (EDF) scheduling algorithm has extensively been utilized in real-time systems, there is almost no literature considering EDF for task sets with dynamic self-suspension behavior. To be precise, there is no specialized result for uniprocessor systems, besides the triv...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computer-aided design of integrated circuits and systems 2020-11, Vol.39 (11), p.4205-4216
Main Authors: Gunzel, Mario, von der Bruggen, Georg, Chen, Jian-Jia
Format: Article
Language:English
Subjects:
Algorithms
Computational modeling
Dynamic scheduling
Embedded software
Empirical analysis
Integrated circuit modeling
Multiprocessing
Processor scheduling
Real-time systems
Scheduling
Suspensions
Task analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:While the earliest-deadline-first (EDF) scheduling algorithm has extensively been utilized in real-time systems, there is almost no literature considering EDF for task sets with dynamic self-suspension behavior. To be precise, there is no specialized result for uniprocessor systems, besides the trivial suspension-oblivious approach. The work by Liu and Anderson (in ECRTS 2013) and Dong and Liu (in RTSS 2016) for suspension-aware multiprocessor global EDF can also be applied to uniprocessor systems and therefore be considered the state-of-the-art. In this work, two novel schedulability analyses (one for sporadic and one for periodic task sets) for suspension-aware EDF on uniprocessor systems are proposed, which outperform the state-of-the-art on such systems in empirical and theoretical comparison. We further show that the analysis by Dong and Liu is in fact not suspension-aware for uniprocessor systems.
ISSN:0278-0070
1937-4151
DOI:10.1109/TCAD.2020.3013095