High performance non-preemptive dynamic scheduling algorithm for soft real time system

Scheduling algorithms for soft real time application should focus on increasing Deadline Meeting Rate (DMTR) during overload. Here we propose an algorithm which is based on EDF which boost the performance of soft real time system during overload while maintaining optimum performance during normal load poses by EDF. This algorithm does not require overload detection as many other overload handling algorithm do. With this algorithm we grouped jobs with nearly identical deadline using a novel algorithm and executes the jobs of a group utilizing another approach. We present the logic behind the algorithm along with some simulation result of the achieved DMTR compared to EDF.