Developing Frequency Falling EDF with Relatively Greater Power Efficiency and Low Deadline Miss Ratio
Keywords:
RT; DVFS; RT-DVFS; EDF; static EDF; WECT; FF-EDF
Abstract
Many scheduling algorithms are available for the real -time system, which maintains hard deadline to solve the issues related to the time that is critical for scheduling in real time system and to provide a better system design in real -time system avoiding poor and erroneous choices for scheduling algorithms. The system is based on a real -time deals with the resource to ensure maximum performance and utilization in real -time. Processor availability plays the main role in choosing the best scheduling algorithm for a real -time system. D VFS is being used extensively for the technique of energy management. The aim of DVFS platform is to minimize energy consumption. In this paper, we will give a new algorithm for DVFS and compare the power consumption and deadline miss ratio of other RT-DVF S algorithm with our algorithm. There are many real time dynamic voltage frequency scheduling (DVFS) algorithms. We have analyzed two independent under loaded task -sets for RT -DVFS scheduler algorithm that is Base -EDF and Static -EDF and devise a new DVFS s cheduler algorithm named Frequency Falling EDF. Our devised FF-EDF algorithm is more efficient than Base -EDF algorithm in terms of power consumption. It also gives better performance than static-EDF in terms of future deadline handling. FF -EDF algorithm focuses on dynamic voltage frequency scheduling.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2017-03-15
Issue
Section
License
Copyright (c) 2017 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.