Enhanced Maximum Urgency First Algorithm with Intelligent Laxity for Real Time Systems

In this paper Enhanced Maximum Urgency First (EMUF) scheduling algorithm with intelligent laxity has been proposed. This algorithm is a further improvement in MMUF algorithm [1] and is a mixed priority scheduling algorithm which combines the advantages of both fixed and dynamic scheduling for better CPU utilization and throughput. The prime objective of this paper is to improve modified maximum urgency first scheduling (MMUF) using intelligent laxity as the dynamic priority. EMUF algorithm is mainly suited for real time systems where meeting of deadlines is an important criterion for scheduling. This proposed algorithm improves the Modified Maximum Urgency First scheduling algorithm for real time tasks proposed by V.Salmani et.al [1] and the experimental analysis shows that the proposed algorithm(EMUF algorithm) performs better than MMUF [1] and MUF[6] scheduling algorithm by minimizing average turnaround time, average waiting time and maximizing the throughput. General Terms Earliest Deadline First scheduling(EDF), Enhanced Maximum Urgency First scheduling (EMUF), Least Laxity First scheduling(LLF), Modified Least Laxity First scheduling(MLLF), Maximum Urgency First scheduling (MUF), Modified Maximum Urgency First scheduling (MMUF), Scheduling