Upgraded Maximum Urgency First Algorithm For Real Time Systems
Κ. K. Sahu, Sourav Kumar Mishra, Satya S. Sahoo · 2013
ABSTRACT:- In this paper Upgraded Maximum Urgency First (UMUF) scheduling algorithm 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 LPB (Laxity per Burst time) as the dynamic priority. UMUF 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(UMUF algorithm) performs better than MMUF [1] and MUF[6] scheduling algorithm by minimizing average turnaround time, average waiting time and maximizing the throughput.