Abstract
In multitasking world of today, CPU scheduling is the only process to determine how different requests can be serviced which are in the ready queue waiting for execution. CPU scheduling algorithms make sure to increase the CPU utilization by decreasing “average turnaround time (TAT),” “average waiting time (WT),” and “context switches” among different processes. Round robin scheduling algorithm is the most efficient algorithm which is used to increase the efficiency of CPU. This paper is proposing a new fluctuating time quantum round robin algorithm (FTQRR) using attributes of “Dynamic Time Quantum based Round Robin” (DTQRR) (Berhanu et al. in Int J Comput Appl 167(13):48–55, 2017 [1]) and “Improved Round Robin with Varying Time Quantum” (IRRVQ) (Kumar Mishra and Rashid in Int J Comput Sci Eng Appl 4(4):1–8, 2014 [2]) such that “average turnaround time, average waiting time, and context switches” among various process will be minimized.
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
Berhanu, Y., Alemu, A., Kumar, M.: Dynamic time quantum based round robin CPU scheduling algorithm. Int. J. Comput. Appl. 167(13), 48–55 (2017)
Kumar Mishra, M., Rashid, F.: An improved round robin CPU scheduling algorithm with varying time quantum. Int. J. Comput. Sci. Eng. Appl. 4(4), 1–8 (2014)
Imran, Q.: CPU scheduling algorithms: a survey. Int. J. Adv. Netw. Appl. 1973, 1968–1973 (2014)
Stallings, W.: Operating Systems Internal and Design Principles (2006)
Silberschatz, A., Galvin, P.B., Greg, G.: Operating System Concepts (2009)
Yadav, R.K., Mishra, M.K., Navin, P., Himanshu, S.: An improved round robin CPU scheduling algorithm for CPU scheduling. J. Glob. Res. Comput. Sci. 3(6), 64–69 (2012)
Noon, A., Kalakech, A., Kadry, S.: A new round robin based scheduling algorithm for operating systems: dynamic quantum using the mean average. J. Comput. Sci. 8(3), 224–229 (2011)
Abdulrahim, A., Aliyu, S., Mustapha, A.M., Abdullahi, S.E.: An Additional Improvement in Round Robin (AAIRR) CPU scheduling algorithm. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 4(2), 601–610 (2014)
Abdulrahim, A., Abdullahi, S.E., Sahalu, J.B.: A New Improved Round Robin (NIRR) CPU scheduling algorithm. Int. J. Comput. Appl. 90(4), 27–33 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Gupta, C., Sharma, K. (2020). Fluctuating Time Quantum Round Robin (FTQRR) CPU Scheduling Algorithm. In: Luhach, A., Kosa, J., Poonia, R., Gao, XZ., Singh, D. (eds) First International Conference on Sustainable Technologies for Computational Intelligence. Advances in Intelligent Systems and Computing, vol 1045. Springer, Singapore. https://doi.org/10.1007/978-981-15-0029-9_37
Download citation
DOI: https://doi.org/10.1007/978-981-15-0029-9_37
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0028-2
Online ISBN: 978-981-15-0029-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)