|
This site uses |
Last updated on
28 October 2024 |
Luca Abeni, T. Cucinotta. "Adaptive Partitioning of Real-Time Tasks on Multiple Processors," in Proceedings of the 35th ACM/SIGAPP Symposium On Applied Computing (ACM SAC 2020), March 30th, 2020, Brno, Czech Republic.
This paper presents a new algorithm for scheduling real-time tasks on multiprocessor/multicore systems. This new algorithm is based on combining EDF scheduling with a migration strategy that moves tasks only when needed. It has been evaluated through an extensive set of simulations that showed good performance when compared with global or partitioned EDF: a worst-case utilisation bound sim- ilar to partitioned EDF for hard real-time tasks, and a tardiness bound similar to global EDF for soft real-time tasks. Therefore, the proposed scheduler is effective for dealing with both soft and hard real-time workloads.
See paper on publisher's website
See paper presentation on YouTube
Last updated on
07 November 2024 |