A proposed priority dynamic quantum time algorithm to enhance varying time quantum round robin algorithm
Pages 184 - 191
Abstract
Management of the processes is an essential task performed by the scheduler in an Operating System OS. One of the important units of the OS is Central Processing Unit CPU, which is scheduling by many algorithms of scheduling. The main purpose of these algorithms is to enhance the system's performance by increasing the utilisation of CPU, increasing the throughput of the system, reducing the turnaround and waiting times and reducing the context switches. Some of the famous scheduling algorithms are First-Come, First-Served, Shortest Job First SJF, Round Robin RR and Priority Scheduling. RR scheduling algorithm is the most suitable choice for time shared system but not for soft real-time systems owing to a large turnaround time, large waiting time and high number of context switches. The choice of the quantum time in RR is the optimal solution for the problem of large turnaround and waiting time with RR. This paper proposes a new algorithm to improve the work of RR by proposing a new algorithm to improve the concept of Improved Round Robin with Varying time Quantum IRRVQ. The proposed algorithm gave results better than IRRVQ in terms of minimising the number of context switches, average waiting time and average turnaround time.
References
[1]
Abdulrahim, A., Abdullahi, S.E. and Sahalu, J.B. (2014) 'A new improved round robin (NIRR) CPU scheduling algorithm', International Journal of Computer Applications, Vol. 90, pp. 27-33.
[2]
Behera, H., Mohanty, R. and Nayak, D. (2011) 'A new proposed dynamic quantum with re-adjusted round robin scheduling algorithm and its performance analysis', International Journal of Computer Applications, Vol. 5, No. 5, pp. 10-15.
[3]
Bhunia, A. (2011) 'Enhancing the performance of feedback scheduling', International Journal of Computer Applications, Vol. 18, pp. 11-16.
[4]
Deitel, H.M., Deitel, P.J. and Choffnes, D.R. (2004) Operating Systems, Pearson/Prentice Hall, Upper Saddle River, NJ.
[5]
Fernandez, G., Jalle, J., Abella, J., Qui�ones, E., Vardanega, T. and Cazorla, F.J. (2015) 'Increasing confidence on measurement-based contention bounds for real-time round-robin buses', Proceedings of the 52nd Annual Design Automation Conference, 7-11 June, San Francisco, CA.
[6]
Hasan, T.F. (2014) 'CPU scheduling visualization', Diyala Journal of Engineering Sciences, Vol. 7, No. 1, pp. 16-29.
[7]
He, J., Zhang, W., Huang, Y. and Yan, W. (2014) 'Dynamic rolling-horizon strategy for the electric trolley scheduling in frame bridge-based automated container terminals based on Hungarian algorithm', International Journal of Computer Applications in Technology, Vol. 50, pp. 166-173.
[8]
Jian, C., Tao, M. and Wang, Y. (2014) 'A particle swarm optimisation algorithm for cloud-oriented workflow scheduling based on reliability', International Journal of Computer Applications in Technology, Vol. 50, pp. 220-225.
[9]
Jing, W., Liu, Y. and Shao, H. (2015) 'Reliability-aware DAG scheduling with primary-backup in cloud computing', International Journal of Computer Applications in Technology, Vol. 52, pp. 86-93.
[10]
Kelly, O.R. and Aydin, H. (2014) 'Fixed-priority global scheduling for mixed-criticality real-time systems', International Journal of Embedded Systems, Vol. 6, pp. 226-276.
[11]
Khalil, Z.H. and Alaasam, A.B.A. (2013) 'Priority based dynamic round robin with intelligent time slice and highest response ratio next algorithm for soft real time system', Global Journal of Advanced Engineering Technologies, Vol. 2, No. 3, pp. 120-124.
[12]
Kiran, R.S., Babu, P.V. and Krishna, B.M. (2013) 'Optimizing CPU scheduling for real time applications using mean-difference round robin (MDRR) algorithm', ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India, 13-15 December, Visakhapatnam, India, pp. 713-721.
[13]
Kontogiannis, S. and Karakos, A. (2014) 'ALBL: an adaptive load balancing algorithm for distributed web systems', International Journal of Communication Networks and Distributed Systems, Vol. 13, pp. 144-168.
[14]
Mahesh Kumar, M., Renuka Rajendra, B., Sreenatha, M. and Niranjan, C. (2014) 'An improved approach to minimize context switching in round Robin scheduling algorithm using optimization techniques', International Journal of Research in Engineering and Technology, Vol. 3, No. 4.
[15]
Mishra, M.K. (2012) 'An improved round robin CPU scheduling algorithm', Journal of Global Research in Computer Science, Vol. 3, pp. 64-69.
[16]
Mishra, M.K. and Rashid, F. (2014) 'An improved round robin CPU scheduling algorithm with varying time quantum', International Journal of Computer Science, Engineering & Applications, Vol. 4, pp. 1-8.
[17]
Mohanty, R., Behera, H., Patwari, K., Dash, M. and Prasanna, M.L. (2011) 'Priority based dynamic round robin (PBDRR) algorithm with intelligent time slice for soft real time systems', International Journal of Advanced Computer Science and Applications, Vol. 2, pp. 45-50.
[18]
Noon, A., Kalakech, A. and Kadry, S. (2011) 'A new round robin based scheduling algorithm for operating systems: dynamic quantum using the mean average', International Journal of Computer Science Issues, Vol. 8, No. 3, pp. 224-229.
[19]
Panda, S.K., Dash, D. and Rout, J.K. (2014) 'A group based time quantum round robin algorithm using min-max spread measure', Vol. 64, No. 10, pp. 1-7.
[20]
Rajput, I.S. and Gupta, D. (2012) 'A priority based round robin CPU scheduling algorithm for real time systems', International Journal of Innovations in Engineering and Technology, Vol. 1, No. 3, pp. 1-11.
[21]
Shah, S.N.M., Zakaria, M.N.B., Haron, N., Mahmood, A.K.B. and Naono, K. (2012) 'Design and evaluation of agent based prioritized dynamic round robin scheduling algorithm on computational grids', AASRI Procedia, Vol. 1, pp. 531-543.
[22]
Silberschatz, A., Galvin, P.B. and Gagne, G. (2013) Operating System Concepts, Vol. 8, Wiley, New York.
[23]
Singh, A., Goyal, P. and Batra, S. (2010) 'An optimized round robin scheduling algorithm for CPU scheduling', International Journal on Computer Science and Engineering, Vol. 2, pp. 2383-2385.
[24]
Siregar, M.U. (2012) 'A new approach to CPU scheduling algorithm: genetic round robin', International Journal of Computer Applications, Vol. 47, pp. 18-25.
[25]
Tan, Y., Huang, W., Sun, Y. and Yue, Y. (2014) 'Scheduling and optimisation of batch plants: model development and comparison of approaches', International Journal of Computer Applications in Technology, Vol. 49, pp. 227-238.
[26]
Varma, P.S. (2013) 'A finest time quantum for improving shortest remaining burst round Robin (SRBRR) algorithm', Journal of Global Research in Computer Science, Vol. 4, pp. 10-15.
[27]
Yadav, R.K., Mishra, A.K., Prakash, N. and Sharma, H. (2010) 'An improved round robin scheduling algorithm for CPU scheduling', International Journal on Computer Science and Engineering, Vol. 2, pp. 1064-1066.
Index Terms
- A proposed priority dynamic quantum time algorithm to enhance varying time quantum round robin algorithm
Recommendations
Prioritized Fair Round Robin Algorithm with Variable Time Quantum
FIT '15: Proceedings of the 2015 13th International Conference on Frontiers of Information Technology (FIT)The performance of the time sharing systems and multiprocessor systems is greatly dependent on CPU scheduling algorithms. Some of the famous algorithms are Shortest Job First (SJF), First Come First Served (FCFS), Priority Scheduling and Round Robin (RR)...
Executed-time Round Robin
Energy conservation has become a prime objective due to excess use and huge demand of energy in data centers. One solution is to use efficient job scheduling algorithms. The scheduler has to maintain the machine's state balance to obtain efficient job ...
Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm
ICCDE '20: Proceedings of 2020 6th International Conference on Computing and Data EngineeringScheduling refers to a set of policies and mechanisms to control the order of work to be performed by a Computer system. Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm is a CPU scheduling ...
Comments
Information & Contributors
Information
Published In
Publisher
Inderscience Publishers
Geneva 15, Switzerland
Publication History
Published: 01 January 2016
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in