Efficiency evaluation of overhead control heuristics in DP-Fair multiprocessor scheduling

A number of optimal algorithms exist for scheduling of periodic taskset with implicit deadlines in real-time multiprocessor systems. However, the practical facts reveal that the optimality is achieved at the cost of excessive scheduling points, migrations and preemptions. In [19], we proposed two heuristics to control the overhead for a class of non-work conserving global scheduling algorithms that combine fluid scheduling and deadline partitioning, while guaranteeing optimality. This paper gives some detailed simulation results along with description of the system to generate the data for the simulation. The given results show the basic strength of the heuristics and validate their efficiency.