Minimizing wait time of aperiodic tasks in the real-time systems with a non-preemptive scheduling algorithm

摘要

The effective scheduling method for aperiodic tasks in the hard real-time systems is presented. The realtime tasks are required to complete execution within their respective time bounds. It is not necessarily desirable to finish tasks early as long as deadline constraint is satisfied. On the other hand, the early completion of aperiodic tasks that have unpredictable arrival times is highly desirable since they may deal with an emergent situation. The proposed scheduh'ng algorithm aims at minimizing wait time of aperiodic tasks while still generating a feasible schedule for periodic tasks. The proposed scheduling technique also maximizes utilization of idle slots.