Migrate when necessary: toward partitioned reclaiming for soft real-time tasks

Houssam Eddine Zahaf (1) , Giuseppe Lipari (1) , Luca Abeni (2) , Houssam-Eddine Zahaf (1)

1 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
2 UNITN - Università degli Studi di Trento = University of Trento

This paper presents a new strategy for scheduling soft real-time tasks on multiple identical cores. The proposed approach is based on partitioned CPU reservations and it uses a reclaiming mechanism to reduce the number of missed deadlines. We introduce the possibility for a task to temporarily migrate to another, less charged, CPU when it has exhausted the reserved bandwidth on its allocated CPU. In addition, we propose a simple load balancing method to decrease the number of deadlines missed by the tasks. The proposed algorithm has been evaluated through simulations, showing its effectiveness (compared to other multi-core reclaiming approaches) and comparing the performance of different partitioning heuristics (Best Fit, Worst Fit and First Fit).

Mots clés: partitioned scheduling; CPU reclaiming; Resource reservations

Domaines: Système d'exploitation [cs.OS]

Houssam Eddine Zahaf, Giuseppe Lipari, Luca Abeni, Houssam-Eddine Zahaf. Migrate when necessary: toward partitioned reclaiming for soft real-time tasks. Proceedings of International Conference on Real-Time Networks and Systems, 2017, 10, pp.1-24. ⟨10.1145/3139258.3139280⟩. ⟨hal-01647624⟩