International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020


IJSTR >> Volume 2- Issue 1, January 2013 Edition

International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616

Upgraded Maximum Urgency First Algorithm For Real Time Systems

[Full Text]



K. K. Sahu, Sourav Mishra, Satya S. Sahoo



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



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. General Terms:- Earliest Deadline First scheduling(EDF), Upgraded Maximum Urgency First scheduling (UMUF), Least Laxity First scheduling(LLF), Modified Least Laxity First scheduling(MLLF), Maximum Urgency First scheduling (MUF), Modified Maximum Urgency First scheduling (MMUF), Scheduling



[1] V.Salmani, S.zargar and M. Naghibzadeh- a modified maximum urgency first scheduling algorithm for real time tasks- world academy of science and technology 9 2005

[2] S.Baskiyar and N. Meghanathan: A Survey Of Contemporary Real Time Operating Systems, Informatica S. 29 pp 233-240, 2005.

[3] C. L. Liu, and J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard real Time Environment,” Journal of the Association for Computing Machinery, vol.20, no.1, pp. 44-61, January 1973.

[4] A. Mok. “Fundamental Design Problems of Distributed Systems for Hard Real-time Environments”. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 1983.

[5] S. H. Oh, and S. M. Yang, “A Modified Least-Laxity-First Scheduling Algorithm for Real-Time Tasks”, in Proc. Fifth International Conference On Real Time Computing System And Application,October1998,pp.31-36

[6] D. B. Stewart , and P.K.Khosla,” Real Time Scheduling Of Dynamically Reconfigurable Systems,” in proc. IEEE International Conference on Systems Engineering, Dayton Ohio, August 1991, pp. 139-142

[7] J. Goossens, and P. Richard, “Overview of real-time scheduling problems”, in Proc. the ninth international workshop on project management and scheduling, Nancy, France, April 2004.

[8] Yaashuwanth .C IEEE Member, Dr.R. Rames Department of Electrical and Electronics Engineering, Anna University Chennai, “Design of Real Time scheduler simulator and Development of Modified Round Robin architecture ”

[9] Silberschatz, A., P.B. Galvin and G. Gagne, Operating Systems Concepts. 7th Edn. John Wiley and Sons, USA

[10] J.Goossens, Universit´e Libre de Bruxelles and P. Richard, Laboratoire d’Informatique Scientifiq et Industrielle ENSMA (France), “Overview of real-time scheduling problems”

[11] S.Chengs, J.A Stankovic and K.Ramamritham: Scheduling Algorithms for Hard Real Time Systems- A Brief Survey –‘Tutorial: hard real time systems’(IEEE, 1988)pp.150-173