High deadline meeting rate of non-preemptive dynamic soft real time scheduling algorithm

Hard real time systems were often implemented with preemptive scheduling, which gives priority to the highest priority task. In this paper we present a new non-preemptive scheduling of jobs meant for soft real time application. Our ultimate aim is to increase the deadline meeting rate of the Earlies...

Full description

Saved in:
Bibliographic Details
Main Authors: Khalib, Z. I. A., Ahmad, B. R., Ong, O. B. L.
Format: Conference Proceeding
Language:English
Subjects:
deadline scheduling
non-preemptive scheduling
soft real time
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Hard real time systems were often implemented with preemptive scheduling, which gives priority to the highest priority task. In this paper we present a new non-preemptive scheduling of jobs meant for soft real time application. Our ultimate aim is to increase the deadline meeting rate of the Earliest Deadline First (EDF) algorithm during overload condition while maintaining the optimum 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 algorithm. We named the approach Group, Utilization and Deadline Tolerance EDF (gutEDF). We will present result comparing the deadline meeting rate and average response time of gutEDF and EDF under different deadline tolerance values and compare the deadline meeting ratio improvement of gutEDF and gEDF.
DOI:10.1109/ICCSCE.2012.6487159