Loading [a11y]/accessibility-menu.js
High performance non-preemptive dynamic scheduling algorithm for soft real time system | IEEE Conference Publication | IEEE Xplore

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


Abstract:

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 ...Show More

Abstract:

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.
Date of Conference: 03-04 December 2012
Date Added to IEEE Xplore: 21 March 2013
ISBN Information:
Conference Location: Kota Kinabalu, Malaysia

I. Introduction

Sometime, people use the term ‘real time’ to refer to online system, instantaneous data acquisition system or high speed interactive system. These are misconceptions [1].

Contact IEEE to Subscribe

References

References is not available for this document.