By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Khalib, Z.I.A. ; Sch. of Comput. & Commun. Eng., Univ. Malaysia Perlis, Kangar, Malaysia ; Ahmad, B.R. ; Ong, O.B.L.

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.

Published in:

Computer Applications and Industrial Electronics (ISCAIE), 2012 IEEE Symposium on

Date of Conference:

3-4 Dec. 2012