Optimal real-time scheduling for efficient aperiodic services on multiprocessors

Optimal real-time scheduling algorithms for multiprocessors have some restrictions to realize the optimality. In this paper, we propose an optimal real-time scheduling algorithm called NNLF (No Nodal Laxity First), which relaxes the restrictions of the traditional algorithm LNREF [8]. NNLF with aperiodic servers is flexible as compared to LNREF with aperiodic servers and enhances the responsiveness of aperiodic services, while all periodic tasks meet their deadlines. Simulation results show that NNLF with aperiodic servers enhances the aperiodic responsiveness approximately 90% relative to the background servers.