An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 2, Issue 2
Abstract
To this paper we have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms for earliest deadline first are presented, both for hard and soft real-time tasks. The average performance of these admission control algorithms is compared with the performance of known partitioning schemes. We have applied some modification to the global earliest deadline first algorithms to decrease the number of task migration and also to add predictability to its behavior. The Aim of this work is to provide a sensitivity analysis for task deadline context of multiprocessor system by using a new approach of EFDF (Earliest Feasible Deadline First) algorithm. In order to decrease the number of migrations we prevent a job from moving one processor to another processor if it is among the m higher priority jobs. Therefore, a job will continue its execution on the same processor if possible (processor affinity). The result of these comparisons outlines some situations where one scheme is preferable over the other. Partitioning schemes are better suited for hard real-time systems, while a global scheme is preferable for soft real-time systems.
Authors and Affiliations
Jagbeer Singh , Bichitrananda Patra , Satyendra Prasad Singh
Keywords
Related Articles
- EP ID EP160670
- DOI -
- Views 137
- Downloads 0
Improving Vertical Handoffs Using Mobility Prediction
The recent advances in wireless communications require integration of multiple network technologies in order to satisfy the increasing demand of mobile users. Mobility in such a heterogeneous environment entails that use...
A Parallel Simulated Annealing Algorithm for Weapon-Target Assignment Problem
Weapon-target assignment (WTA) is a combinatorial optimization problem and is known to be NP-complete. The WTA aims to best assignment of weapons to targets to minimize the total expected value of the surviving targets....
Vismarkmap – A Web Search Visualization Technique through Visual Bookmarking Approach with Mind Map Method
Due to the massive growth of information over the Internet, Bookmarking becomes the most popular technique to keep track of the websites with the expectation of finding out the previously searched websites easily wheneve...
Fuzzy Logic Tsukamoto for SARIMA On Automation of Bandwidth Allocation
The wireless network is used in different fields to enhance information transfer between remote areas. In the education area, it can support knowledge transfer among academic member including lecturers, students, and sta...
Educational Game Application Development on Classification of Diseases and Related Health Problems Treatment in Android Platform
The classification and codification of diseases and related problems is one of the competences of medical recorder as stated in Kepmenkes RI.377 in 2007. The current problem is the lack of reference exercise in learning...