Main page Research activities Publications Talks MSc thesis projects Mentoring Hobby and spare time Write me This site uses
Google Analytics
Last updated on
16 November 2020

Publication details

L. Abeni, T. Cucinotta. "EDF scheduling of real-time tasks on multiple cores: adaptive partitioning vs. global scheduling," ACM SIGAPP Applied Computing Review, Vol. 20, Issue 2 (June 2020), pp. 5-18, July 2020

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.

Download paper

See paper on publisher's website


Main page Research activities Publications Talks MSc thesis projects Mentoring Hobby and spare time Write me Last updated on