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 98
- Downloads 0
An Empirical Evaluation of Error Correction Methods and Tools for Next Generation Sequencing Data
Next Generation Sequencing (NGS) technologies produce massive amount of low cost data that is very much useful in genomic study and research. However, data produced by NGS is affected by different errors such as substitu...
Detection of Routing Misbehavior in MANETs with 2ACK scheme
The Routing misbehavior in MANETs (Mobile Ad Hoc Networks) is considered in this paper. Commonly routing protocols for MANETs [1] are designed based on the assumption that all participating nodes are fully cooperative. R...
Menu Positioning on Web Pages. Does it Matter?
This paper concerns an investigation by the authors into the efficiency and user opinions of menu positioning in web pages. While the idea and use of menus on web pages is not new, the authors feel there is not enough em...
Time Series Analysis for Shortened Labor Mean Interval of Dairy Cattle with the Data of BCS, RFS, Weight, Amount of Milk and Outlook
MTime series analysis for shortened labor mean interval of dairy cattle with the data of Body Condition Score (BCS), Rumen Fill Score (RFS), Weight, Amount of Milk and Outlook is conducted. Method for shortened the labor...
Recurrence Relation for Projectile Simulation Project and Game based Learning
Huge Gap has been observed on study of projectile simulation models relating it to speed of camera or frame per seconds. The objective of this paper is to explore and investigate time driven simulation models to mimic pr...