The week's pick
Random Articles
Reseach Article
Enhanced Maximum Urgency First Algorithm with Intelligent Laxity for Real Time Systems
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 44 - Number 8 |
| Year of Publication: 2012 |
| Authors: H. S. Behera, Naziya Raffat, Minarva Mallik |
10.5120/6283-8460
|
H. S. Behera, Naziya Raffat, Minarva Mallik . Enhanced Maximum Urgency First Algorithm with Intelligent Laxity for Real Time Systems. International Journal of Computer Applications. 44, 8 ( April 2012), 20-26. DOI=10.5120/6283-8460
Abstract
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.
References
- 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
- S. Baskiyar and N. Meghanathan: A Survey Of Contemporary Real Time Operating Systems, Informatica S. 29 pp 233-240, 2005.
- 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.
- A. Mok. "Fundamental Design Problems of Distributed Systems for Hard Real-time Environments". PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 1983.
- 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
- 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
- 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.
- 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 "
- Silberschatz, A. , P. B. Galvin and G. Gagne, Operating Systems Concepts. 7th Edn. John Wiley and Sons, USA
- J. Goossens, Universit´e Libre de Bruxelles and P. Richard, Laboratoire d'Informatique Scientifiq et Industrielle ENSMA (France), "Overview of real-time scheduling problems"
- 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
Index Terms
Keywords