A non-preemptive soft real time scheduler

Abstract

Soft real time system tolerates missing deadline to a certain limit. However, enhancing the deadline meeting ratio (DMTR) of a soft real time system is definitely favorable as it will increase the system performance. In this paper we present a new non-preemptive dynamic scheduling algorithm for soft real time application with the ultimate aim of increasing the deadline meeting ratio of the evergreen Earliest Deadline First (EDF) algorithm during overload condition while maintaining the excellent performance it poses during normal load. Our approach, grouped jobs with near deadlines together using our novel algorithm and schedule the jobs within a group using another novel approach has boost the performance during overload. We named the approach Group, Utilization and Deadline Tolerance EDF (gutEDF). We will present results comparing the deadline meeting ratio of gutEDF and EDF under different deadline tolerance values and the Deadline Meeting Ratio improvement of the algorithm.