Comparison of Dynamic Scheduling Algorithm for Real Time Operating System
| Author(s) | : | HemangThakar |
| Institution | : | AssistantProfessor,CSED e pa rt m ent D J M I T |
| Published In | : | Vol. 2, Issue 13 — January 2015 |
| Page No. | : | - |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Real timesystem isdivided in to two algorithms staticand dynamic. Both algorithmwant to complete his job ingivendeadline or before deadline but no onealgorithmaresuccessfullycompletehis jobin overloadedandunderloadedsituation.Dynamicalgorithmabletogive optimalresultinunder- loadedsituationbut not abletogivesame resultinov er-loadedsituation.Staticalgorithmnotabletogiveoptimalresultinunderloadedsituation butabletoperformwell inover-loaded situation.Sowethinknewalgorithmtogiveresultoptimuminunder-loadedsituation andgivehigh resultin ov er-loadedsituation. We are servingdynamic scheduling algorithms like EDF (Earlierdead line first),MLF (Minimum Laxity First) and RM algorithms perform well inoverloaded situation. Here servingthat EDF, M LFandRMalgorithmstogivearesultinunder-loadedsituation and inoverloaded situation.
HemangThakar, “Comparison of Dynamic Scheduling Algorithm for Real Time Operating System”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 2, Issue 13, pp. -, January 2015.
