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 113
- Downloads 0
Design and Implementation for Multi-Level Cell Flash Memory Storage Systems
The flash memory management functions of write coalescing, space management, logical-to-physical mapping, wear leveling, and garbage collection require significant on-going computation and data movement. MLC flash memory...
Performance Evaluation of Network Gateway Design for NoC based System on FPGA Platform
Network on Chip (NoC) is an emerging interconnect solution with reliable and scalable features over the System on Chip (SoC) and helps to overcome the drawbacks of bus-based interconnection in SoC. The multiple cores or...
Critical Path Reduction of Distributed Arithmetic Based FIR Filter
Operating speed, which is reciprocal of critical path computation time, is one of the prominent design matrices of finite impulse response (FIR) filters. It is largely affected by both, system architecture as well as tec...
The Role of Technical Analysis Indicators over Equity Market (NOMU) with R Programing Language
The stock market is a potent, fickle and fast-changing domain. Unanticipated market occurrences and unstructured financial information complicate predicting future market responses. A tool that continues to be advantageo...
A New Healthcare Context Information: The Social Context
During the treatment process, medical institutes collect context information about their patients and store it in their healthcare systems. The collected information describes the measurable, risk, or medication informat...