,
Christopher Gill
,
Sanjoy Baruah
Creative Commons Attribution 4.0 International license
Elastic scheduling provides a framework under which the utilizations of recurrent tasks are reduced by increasing their periods in response to system overload. The original elastic scheduling model was proposed by Buttazzo et al. in 1998 for implicit-deadline tasks on a uniprocessor and decreases task utilizations to satisfy a schedulable utilization bound. In 2019, Orr and Baruah extended the framework to multiprocessor scheduling of implicit-deadline tasks. In this paper, we propose, analyze, and evaluate new elastic scheduling algorithms for several of the scheduling policies considered in these prior works. In particular, (i) we evaluate an algorithm that we proposed as a short note in the Real-Time Systems journal and demonstrate that it allows for faster admission control than the algorithm of Buttazzo et al. when applied to uniprocessor and fluid scheduling. (ii) We also present faster elastic scheduling algorithms for partitioned EDF scheduling. Finally, (iii) we provide polynomial-time exact elastic scheduling algorithms for global EDF and global RM.
@Article{sudvarg_et_al:LITES.10.2.2,
author = {Sudvarg, Marion and Gill, Christopher and Baruah, Sanjoy},
title = {{Improved Elastic Scheduling Algorithms for Implicit-Deadline Tasks}},
journal = {Leibniz Transactions on Embedded Systems},
pages = {2:1--2:36},
ISSN = {2199-2002},
year = {2025},
volume = {10},
number = {2},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.10.2.2},
URN = {urn:nbn:de:0030-drops-252346},
doi = {10.4230/LITES.10.2.2},
annote = {Keywords: real-time systems, elastic scheduling, scheduling algorithms}
}