Enhancing Fixed Priority Scheduling Algorithms for Real-Time Tasks on Multiprocessors
Min-Kyu Park, Sangchul Han, Heeheon Kim, Seong-je Cho, Yookun Cho · 2005
This paper presents a scheme to enhance fixed priority scheduling algorithms on multiprocessors. This scheme gives the highest priority to jobs with zero laxity and schedules them Prior to other jobs. A fixed priority algorithm employing this scheme strictly dominates the original one; it can schedule all task sets schedulable by the fixed priority algorithm and some task sets not schedulable by the fixed priority algorithm. Simulation results show that the proposed scheme improves fixed priority algorithms in terms of the number of schedulable task sets and schedulable utilization bound.