Comparison between EDF_RM and EDF_DM in dynamic scheduling algorithm with sporadic task
EDF, LLF, RM, DM, Scheduling Algorithms, Real-Time operating Systems.
Real time system is divided in to two algorithms static and dynamic. Both algorithm want to complete his job in given deadline or before deadline but no one algorithm are successfully complete his job in overloaded and under loaded condition. Dynamic algorithm able to give optimal result in under-loaded condition but not able to give same result in over-loaded condition. Static algorithm not able to give optimal result in under-loaded condition but able to perform well in over-loaded condition. So we think new algorithm to give result optimum in under-loaded condition and give high result in over-loaded condition. We are thinking to mix up dynamic scheduling algorithm EDF (Earlier dead line first) and static scheduling algorithm DM (dead line monotonic). EDF algorithm give optimal result in under-loaded condition and DM algorithm perform well in over-loaded condition. In this paper we compare EDF_RM and EDF_DM algorithm. Here EDF_RM is better than EDF_DM.
"Comparison between EDF_RM and EDF_DM in dynamic scheduling algorithm with sporadic task", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.1, Issue 5, page no.49 - 51, May-2016, Available :https://ijsdr.org/papers/IJSDR1605010.pdf
Volume 1
Issue 5,
May-2016
Pages : 49 - 51
Paper Reg. ID: IJSDR_160283
Published Paper Id: IJSDR1605010
Downloads: 000347075
Research Area: Engineering
Country: Anand, Gujarat, India
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave
