Improved Implicit-Deadline Elastic Scheduling

Abstract

Elastic scheduling provides a framework under which the utilizations of recurrent tasks are reduced by increasing their periods in response to system overload. First proposed by Buttazzo et al. in 1998 for uniprocessor scheduling of implicit-deadline tasks, elastic scheduling was extended to multiprocessor scheduling algorithms by Orr and Baruah in 2019. In this paper, we propose and analyze improvements to elastic scheduling of implicit-deadline tasks. (i) We evaluate a new algorithm that we proposed as a short note in the Real-Time Systems journal, and demonstrate that it allows for faster admission control than Buttazzo's algorithm when applied to uniprocessor and fluid scheduling. (ii) We propose and analyze faster elastic scheduling algorithms for partitioned EDF scheduling. (iii) We provide an exact algorithm for elastic scheduling under global EDF.

Department(s)

Computer Science

Comments

National Science Foundation, Grant CPS-2229290

Keywords and Phrases

elastic scheduling; real-Time systems

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 2024

Link to Full Text

Share

 
COinS