Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Multiprocessor Scheduling with Few Preemptions
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
On the Implementation of Global Real-Time Schedulers
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Is Semi-Partitioned Scheduling Practical?
ECRTS '11 Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems
Hi-index | 0.00 |
EKG is a multiprocessor scheduling algorithm which is optimal for the schedule of real-time periodic tasks with implicit deadlines. It adheres to the deadline partitioning fair (DP-Fair) approach. However, it was shown in recent studies that the systematic execution of some tasks inherent in such approaches, significantly reduce the usability of this algorithm. Hence, we propose a swapping algorithm with the aim of reducing the number of preemptions and migrations incurred by EKG. This algorithm should enhance the practicality of EKG while keeping its optimality.