An Efficient Non-Preemptive Algorithm for Soft Real-Time Systems using Domain ClusterGroup EDF

Abstract

In this paper a new non-preemptive domain clustering scheduling algorithm for soft real time application is proposed. The main aim of this algorithm is to achieve high deadline meeting ratio of the group Earliest Deadline First (gEDF) algorithm by maintaining the excellent performance during normal load. An efficient non-preemptive algorithm called Domain Cluster -group EDF (DC-gEDF) is proposed for real time systems which makes clustering the task according to the domain specification with their deadlines and schedules the tasks within a group. The results are analysed and compared for the metric deadline meeting ratio of gEDF and DC-gEDF under different deadline acceptable values. It shows an improvement in the deadline meeting ratio for the proposed DC-g-EDF algorithm.