The week's pick
Reseach Article
Improvised Optimum Multilevel Dynamic Round Robin Algorithm for Optimizing CPU Scheduling
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 123 - Number 16 |
| Year of Publication: 2015 |
| Authors: Neetu Goel, R.B. Garg |
10.5120/ijca2015905720
|
Neetu Goel, R.B. Garg . Improvised Optimum Multilevel Dynamic Round Robin Algorithm for Optimizing CPU Scheduling. International Journal of Computer Applications. 123, 16 ( August 2015), 1-5. DOI=10.5120/ijca2015905720
Abstract
CPU scheduling has strong effect on resource utilization as well as overall performance of the system. In order to simulate the behavior of multiple jobs in a multiprogramming computer system needs to be specified. The most important aspect of job scheduling is the ability to create a multi-tasking environment. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. Round Robin algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems, because it gives more number of context switches, larger waiting time and larger response time. The main objective of this paper is to improve the previous OMDRRS with calculates intelligent time slice and warps after every round of execution and assumed that all the processes were come at randomly as well as all the processes have priority. In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, we purpose new improved CPU scheduling algorithm called “Optimum Dynamic Round Robin Scheduling” (OMDRR). Our experimental results show that our proposed algorithm performs better in terms of reducing the number of context switch, average waiting time and average turnaround time.
References
- Sukanya Suranauwarat, “A CPU Scheduling Algorithm Simulator”, October 10-13, 2007, Milwaukee, WI 37th ASEE/IEEE Frontiers in Education Conference.
- Goel N., Garg R. B., “A Simulation of an Optimum Multilevel Dynamic Round Robin Scheduling Algorithm”, International Journal of Computer Applications , ISSN 0975 – 8887, Volume 76– No.7, August 2013
- http://vip.cs.utsa.edu/classes/cs3733s2004/notes/ps/r unps.html
- http://www.codeplex.com/cpuss
- F. Padberg, “A Software Process Scheduling Simulator”, in Proc. of the 25th IEEE International Conference on Software Engineering (ICSE’03), 0270-5257/03,2003
- http://www.ontko.com/moss
- D.A. Cardella, “A Simulator of Operating system Job Scheduling”, Visual Basic 6. Available for download http://www.freevbcode.com/ShowCode.asp?ID=407 9,2002
- S. H. Nazleeni, H. M. A. Anang, M. H. Hasan, A. A.Izzatdin, and M. W. Wirdhayu, ”Time comparative simulator for distributed process scheduling algorithms,” World Academy of Science, Engineering and Technology 19, pp.84-89,2006
- Anifowose F. A., “MySIM: A Light-Weight Tool for the simulation of Probabilistic CPU Process Scheduling Algorithm”, International Journal of Computer and Electrical Engineering, Vol. 4, No. 1, February 2012
- Umar Saleem and Muhammad Younus Javed, “Simulation of CPU Scheduling Alogrithm”, 0- 7803-6355-8/00/$10.00@2000 IEEE
- Sun Huajin’, Gao Deyuan, Zhang Shengbing, Wang Danghui; “ Design fast Round Robin Scheduler in FPGA”, 0-7803-7547-5/021/$17.00@2002 IEEE
- Md. Mamunur Rashid and Md. Nasim Adhtar, “ A New Multilevel CPU Scheduling Algorithm”, Journals of Applied Sciences 6 (9): 2036-2039,2009
- Goel N., Garg R. B., “A Comparative Study of CPU Scheduling Algorithms”, International Journal of Graphics Image Processing (IJGIP), Vol 2 issue 4, Dec-2012
- Silberschatz, A. P.B. Galvin and G. Gagne (2012), Operating System Concepts, 8th edition, Wiley India.
- Sabrian, F., C.D. Nguyen, S. Jha, D. Platt and F. Safaei, (2005), “Processing resource scheduling in programmable networks”, Computer communication, 28:676-687 Seltzer, M P. Chen and J outerhout, 1990, “Disk scheduling revisited in USENIX”, Winter technical conference.
Index Terms
Keywords