Abstract
Throughput of the system in multiprogramming and time sharing systems mainly depends on the careful scheduling of the CPU and other I/O devices. CPU scheduling should control the waiting time, response time, turnaround time, and number of context switches. One of the most extensively used scheduling algorithms is shortest next remaining time first (SRTF), which gives the reduced amount of average waiting time. But this algorithm suffers from some drawbacks. One such is that, every upcoming process if selected for execution, causes a context switch even though it is slightly shorter than the currently running process. As the number of such situations increases, the number of context switches increases, causing the reduction in performance of the system. In this paper, we modify the traditional SRTF to intelligent SRTF, by changing the decision of the preemption, to decrease the number of context switches. The main idea of our proposed algorithm is to make a context switch only if the next process plus context switch over head is shorter than the currently running process. By this we can reduce the number of context switches and thereby the performance of the system is improved.
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. (2013). Operating Systems Concepts (9th ed.). Wiley. p. 161. ISBN 0-471-69466-5.
Tanenbaum, A. S. (2008). Modern Operating Systems (3rd ed.). Pearson Education, Inc. p. 156. ISBN 0-13-600663-9.
“Computer Scheduling Methods and their Countermeasures” Edward G. Coffman and Leonard Kleinrock AFIPS 68 (Spring), April 1968.
Andrew S. Woodhull, Andrew S. Tanenbaum. Operating Systems Design and Implementation, 2nd Edition. Prentice-Hall, 1997.
Con Kolivas, Linux Kernel CPU Scheduler Contributor, IRC conversations, no transcript. December 2004.
Stallings, William (2004). Operating Systems Internals and Design Principles (fifth international edition). Prentice Hall. ISBN 0-13-147954-7.
“Analysis of a Time-Shared Processor” Leonard Kleinrock Naval Research Logistics Quarterly, 11: 1, pages 5973, March 1964.
D Praveen Kumar, T Sreeninvasula Reddy and A Yugandhar Reddy; “Finding Best Time Quantum for Round Robin Scheduling Algorithm to avoid Frequent Context Switch” IJCSIT, Vol 5 Issue 5; Sep 2014.
Chuanpeng Li, Chen Ding, Kai Shen, “Quantifying The Cost of Context Switch”, ACM Trans. Comput. Syst.
“The effect of context switches on cache performance” Jeffrey C. Mogul and Anita Borg ASPLOS, 1991.
S. Khanna, M. Sebree, and J. Zolnovsky. “Realtime scheduling in SunOS 5.0”. Proceedings of the USENIX Winter Conference, 1992: 375390.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this paper
Cite this paper
Shoba Bindu, C., Yugandhar Reddy, A., Dileep Kumar Reddy, P. (2017). Intelligent SRTF: A New Approach to Reduce the Number of Context Switches in SRTF. In: Satapathy, S., Prasad, V., Rani, B., Udgata, S., Raju, K. (eds) Proceedings of the First International Conference on Computational Intelligence and Informatics . Advances in Intelligent Systems and Computing, vol 507. Springer, Singapore. https://doi.org/10.1007/978-981-10-2471-9_37
Download citation
DOI: https://doi.org/10.1007/978-981-10-2471-9_37
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-2470-2
Online ISBN: 978-981-10-2471-9
eBook Packages: EngineeringEngineering (R0)