ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Upgraded Maximum Urgency First Algorithm For Real Time Systems

Journal: International Journal of Scientific & Technology Research (Vol.2, No. 1)

Publication Date:

Authors : ; ; ;

Page : 26-33

Keywords : Keywords- Context switches; intelligent laxity; laxity; process; real time system; real time system scheduling; turnaround time; throughput; waiting time;

Source : Downloadexternal Find it from : Google Scholarexternal


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 1 and the experimental analysis shows that the proposed algorithmUMUF algorithm performs better than MMUF 1 and MUF6 scheduling algorithm by minimizing average turnaround time average waiting time and maximizing the throughput.General Terms- Earliest Deadline First schedulingEDF Upgraded Maximum Urgency First scheduling UMUF Least Laxity First schedulingLLF Modified Least Laxity First schedulingMLLF Maximum Urgency First scheduling MUF Modified Maximum Urgency First scheduling MMUF Scheduling

Last modified: 2013-04-13 21:54:16