Elastic Scheduling For Fixed-Priority Constrained-Deadline Tasks

Author

• Marion Sudvarg, Missouri University of Science and TechnologyFollow
• Sanjoy Baruah
• Chris Gill

Abstract

Elastic scheduling provides a model for systems in which individual task utilizations can adapt to guarantee schedulability despite limited resources. Each task is characterized by a range of acceptable utilizations and an 'elastic constant' representing its flexibility to reduce or 'compress' its utilization from the desired maximum. Utilization compression is realized by either extending task periods or reducing workloads. This paper extends the model to address period compression for fixed-priority constrained-deadline task systems scheduled on a uniprocessor. We propose two approximate algorithms and one optimal algorithm for determining compression under the model. We then compare the execution times and accuracies of all three, demonstrating that even for large task sets, online compression can be performed feasibly on low-powered embedded systems.

Recommended Citation

M. Sudvarg et al., "Elastic Scheduling For Fixed-Priority Constrained-Deadline Tasks," Proceedings 2023 IEEE 26th International Symposium on Real Time Distributed Computing Isorc 2023, pp. 11 - 20, Institute of Electrical and Electronics Engineers, Jan 2023.

The definitive version is available at https://doi.org/10.1109/ISORC58943.2023.00014

Department(s)

Computer Science

Comments

National Science Foundation, Grant CNS-2141256

Keywords and Phrases

deadline-monotonic priority assignment; elastic constrained-deadline task model; uniprocessor fixed-priority scheduling

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2026 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Publication Date

01 Jan 2023