Enhancement in LLF Scheduling Algorithm: E_LLF Scheduling Algorithm for Real-Time Systems
| Author(s) | : | Pooja Patel, Prem Balani, Vishal Prajapati |
| Institution | : | M. E. Information Technology,G H Patel College of Engg. & Tech.,Vallabh Vidyanagar, Gujarat, India |
| Published In | : | Vol. 2, Issue 6 — June 2015 |
| Page No. | : | 146-151 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Scheduling Algorithm is used to schedule set of tasks. Basically, Two types of scheduling algorithm exist. One isStatic scheduling algorithm which assigns all priorities at design time, and it remains constant for the lifetime of a task.Another is Dynamic Scheduling Algorithm. It assigns priority at runtime, based on execution parameters of tasks which canchange its priority during its execution. Least Laxity First (LLF) and Earlier Deadline First (EDF) are two most commonDynamic scheduling algorithm used in Real-Time Systems. LLF algorithm schedule task which has least laxity or slack time.LLF algorithm gives optimum result in under loaded condition. But, Performance of LLF algorithm decrease drastically inoverloaded condition.In this paper, we have proposed Enhanced Least Laxity First (E_LLF) scheduling algorithm wh ich works same as LLFscheduling algorithm in under loaded condition. But, In overloaded condition algorithm deletes those jobs which havealready missed their deadline (or expected to miss its deadline) or ignore job with maximum execution time based on p rioritycriteria so that other jobs have chance to complete their execution on processor.
Pooja Patel, Prem Balani, Vishal Prajapati, “Enhancement in LLF Scheduling Algorithm: E_LLF Scheduling Algorithm for Real-Time Systems”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 2, Issue 6, pp. 146-151, June 2015.
