Abstract
This paper aims to develop the round-robin (RR) process scheduling algorithm, to get optimized waiting and turnaround time with less number of context switching for the given process. RR algorithm is the most adopted algorithm in modern computing as it overcomes the problem of starvation in first-come first-serve (FCFS) and short job first (SJF). In this article, an improved round-robin algorithm is proposed by calculating the mean of the given processes namely Check Mean with round-robin (CMRR), which reduces the average waiting time (AWT) and average turnaround time (ATT) of the given processes. The drawback of the present round-robin algorithm is that it turns to FCFS in case of large time quantum values which results in higher waiting and turnaround time of the processes. This method gives the most optimized values for scheduling the given processes reducing waiting and turnaround time comparatively. This method is more efficient if the processes burst time is in ascending order. It also reduces the number of context switches increasing the throughput.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Silberschatz, A., Galvin, P.B., Gagne, G.: Operating Systems Concepts, 9th ed. Wiley
Stallings, W.: Operating Systems Internals and Design Principles, 7th ed. Prentice Hall, Pearson Publications
Rajput, I.S., Gupta, D.: A priority based round robin CPU scheduling algorithm for real time systems. IJIET 1(3), 1–11 (2012)
Somani, M.J.S., Chhatwani, M.P.K.: Comparative study of different CPU scheduling algorithms. IJCSMC, 310–318 (2013)
Goel, N., Garg, R.B.: A Comparative Study of CPU Scheduling Algorithms. arXiv preprint (2013). arXiv:1307.4165
Dhakad, V.K., Sharma, L.: Performance analysis of round robin scheduling using adaptive approach based on smart time slice and comparison with SRR. Int. J. Adv. Eng. Technol. (2012)
Wang, W., Casale, G.: Evaluating weighted round robin load balancing for cloud web services. In: 2014 16th International Symposium on SYNASC. IEEE, pp. 393–400, Sept 2014
Noon, A., Kalakech, A., Kadry, S.: A new round robin based scheduling algorithm for operating systems: dynamic quantum using the mean average. arXiv preprint (2011). arXiv:1111.5348
Saeidi, S., Baktash, H.A.: Determining the optimum time quantum value in round robin process scheduling method. IJITCS 4(10), 67 (2012)
Shyam, R., Nandal, S.K.: Improved mean round robin with short job first scheduling. Int. J. Adv. Res. Comput. Sci. Software Eng. (2014). ISSN: 2277 128X
Arora, H., Arora, D., Goel, B., Jain, P.: An Improved CPU Scheduling Algorithm
Ajmani, P., Sethi, M.: Proposed fuzzy CPU scheduling algorithm (PFCS) for real time operating systems. IJIT (2013)
Mishra, M.K., Khan, A.K.: An improved round robin CPU scheduling algorithm. J. Glob. Res. Comput. Sci. 3(6) (2012). ISSN 2229-371X
Ramabhadran, S., Pasquale, J.: Stratified round robin: a low complexity packet scheduler with bandwidth fairness and bounded delay. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. ACM, pp. 239–250, Aug 2003
Jain, N., Menache, I., Naor, J.S., Yaniv, J.: Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. ACM Trans. Parallel Comput. 2(1), 3 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sujith Kumar Reddy, N., Santhi, H., Gayathri, P., Jaisankar, N. (2018). A New CPU Scheduling Algorithm Using Round-robin and Mean of the Processes. In: Muttoo, S. (eds) System and Architecture. Advances in Intelligent Systems and Computing, vol 732. Springer, Singapore. https://doi.org/10.1007/978-981-10-8533-8_23
Download citation
DOI: https://doi.org/10.1007/978-981-10-8533-8_23
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-8532-1
Online ISBN: 978-981-10-8533-8
eBook Packages: EngineeringEngineering (R0)