EDF scheduling of real-time tasks on multiple cores: adaptive partitioning vs. global scheduling

Type of publication
Article in journal
Authors

Luca Abeni, Tommaso Cucinotta. ACM. 2020.

Conference / Journal
ACM SIGAPP Applied Computing Review
Publisher
Association for Computing Machinery (ACM)
Year of publication
2020
Place of publication
New York, NY, USA.
Citation

Luca Abeni and Tommaso Cucinotta. 2020. EDF scheduling of real-time tasks on multiple cores: adaptive partitioning vs. global scheduling. SIGAPP Appl. Comput. Rev. 20, 2 (June 2020), 5–18. https://doi.org/10.1145/3412816.3412817

Abstract

This paper presents a novel migration algorithm for real-time tasks on multicore systems, based on the idea of migrating tasks only when strictly needed to respect their temporal constraints and a combination of this new algorithm with EDF scheduling. This new "adaptive migration" algorithm is evaluated through an extensive set of simulations showing good performance when compared with global or partitioned EDF: our results highlight that it provides a worst-case utilisation bound similar to partitioned EDF for hard real-time tasks and an empirical tardiness bound (like global EDF) for soft real-time tasks. Therefore, the proposed scheduler is effective for dealing with both hard and soft real-time workloads.

Link to the repository
https://www.iris.sssup.it/retrieve/dd9e0b32-570d-709e-e053-3705fe0a83fd/ACM-SAC…
Link to the publication
https://dl.acm.org/doi/abs/10.1145/3412816.3412817
DOI
https://doi.org/10.1145/3412816.3412817
ISSN number
978-1-4503-6866-7