Skip to main content
main-content
Top

Hint

Swipe to navigate through the chapters of this book

2021 | OriginalPaper | Chapter

A Survey on Different Scheduling Algorithms in Operating System

Author : G. Chitralekha

Published in: Computer Networks and Inventive Communication Technologies

Publisher: Springer Nature Singapore

share
SHARE

Abstract

Allotting resources for process execution is one of the important procedures to be done in any operating system. Mostly in battery operated systems, where the resources are scarce, it becomes more challenging to have the resource management done, having promised all the processes equal opportunity of resource accesses. There are several algorithms for resource allotment developed and each one of the algorithms thrives to do resource allotment to all the processes dynamically. In this paper, a detailed review of the existing scheduling techniques for resource management has been done. Also, state-of-the-art scheduling mechanisms have been discussed and a comparison has been done among the existing state-of-the-art mechanisms. Finally, the challenges faced by scheduling techniques and how to overcome is also covered.
Literature
1.
go back to reference Helmy T, Dekdouk A (2007) Burst round robin as a proportional-share scheduling algorithm. IEEEGCC, 2007 Helmy T, Dekdouk A (2007) Burst round robin as a proportional-share scheduling algorithm. IEEEGCC, 2007
2.
go back to reference Shreedhar M, Varghese G (1996) Efficient fair queuing using deficit round-robin. IEEE/ACM Trans Netw., Jun 1996 Shreedhar M, Varghese G (1996) Efficient fair queuing using deficit round-robin. IEEE/ACM Trans Netw., Jun 1996
3.
go back to reference Silberschatz A, Galvin PB, Gagne G (1998) Operating system concepts, vol 4. Addison-Wesley, Reading Silberschatz A, Galvin PB, Gagne G (1998) Operating system concepts, vol 4. Addison-Wesley, Reading
4.
go back to reference Uuganbaatar N (2010) Optimality of first-come-first-served: a unified approach. (2010, December) Uuganbaatar N (2010) Optimality of first-come-first-served: a unified approach. (2010, December)
5.
go back to reference Chung J, Chatterjee D (2013, August) Enhanced shortest-job-first memory request scheduling Chung J, Chatterjee D (2013, August) Enhanced shortest-job-first memory request scheduling
6.
go back to reference Alsadeh A, Yahya A (2008) Shortest remaining response time scheduling for ımproved web server performance. In: 4th International Conference, web ınformation systems and technologies, WEBIST 2008, Funchal, Madeira, Portugal, 4–7 May 2008 Alsadeh A, Yahya A (2008) Shortest remaining response time scheduling for ımproved web server performance. In: 4th International Conference, web ınformation systems and technologies, WEBIST 2008, Funchal, Madeira, Portugal, 4–7 May 2008
8.
go back to reference Son SH, Park S (1994) A priority-based scheduling algorithm for real-time databases. J Inf Sci Eng 11:233–248 Son SH, Park S (1994) A priority-based scheduling algorithm for real-time databases. J Inf Sci Eng 11:233–248
9.
go back to reference Mana SC (2012) Recourse management using a fair share scheduler. Int J Comput Sci Secur (IJCSS) 6:29–33 Mana SC (2012) Recourse management using a fair share scheduler. Int J Comput Sci Secur (IJCSS) 6:29–33
10.
go back to reference Waldspurger C, Weihl W (1994) Lottery scheduling: flexible proportional-share resource management. In: OSDI '94: Proceedings of the 1st USENIX Conference on Operating Systems Design and Implementation, November 1994 Waldspurger C, Weihl W (1994) Lottery scheduling: flexible proportional-share resource management. In: OSDI '94: Proceedings of the 1st USENIX Conference on Operating Systems Design and Implementation, November 1994
12.
go back to reference Choffnes D, Astley M, Ward MJ (2008) Migration policies for multi-core fair-share scheduling. ACM SIGOPS Oper Syst Rev 42(1):92–93 Choffnes D, Astley M, Ward MJ (2008) Migration policies for multi-core fair-share scheduling. ACM SIGOPS Oper Syst Rev 42(1):92–93
15.
go back to reference Jeffay K, Smith FD, Moorthy A, Anderson J (1998) Proportional share scheduling of operating system services for real-time applications. In: The 19th IEEE Proceedings ın Real-time Systems Symposium, pp 480–491 Jeffay K, Smith FD, Moorthy A, Anderson J (1998) Proportional share scheduling of operating system services for real-time applications. In: The 19th IEEE Proceedings ın Real-time Systems Symposium, pp 480–491
16.
go back to reference Mohanty PR, Behera PHS, Patwari K, Dash M, Prasanna ML (2011) Priority based dynamic round robin (PBDRR) algorithm with ıntelligent time slice for soft real time systems. Int J Adv Comput Sci Appl (IJACSA) 2(2):46–50 Mohanty PR, Behera PHS, Patwari K, Dash M, Prasanna ML (2011) Priority based dynamic round robin (PBDRR) algorithm with ıntelligent time slice for soft real time systems. Int J Adv Comput Sci Appl (IJACSA) 2(2):46–50
17.
go back to reference Isard M, Prabhakaran V, Currey J, Wieder U, Talwar K, Goldberg A (2009) Quincy: fair scheduling for distributed computing clusters. In: Proceedings of 22nd ACM Symposium on Operating Systems Principles, October 2009, Published by Association for Computing Machinery, Inc Isard M, Prabhakaran V, Currey J, Wieder U, Talwar K, Goldberg A (2009) Quincy: fair scheduling for distributed computing clusters. In: Proceedings of 22nd ACM Symposium on Operating Systems Principles, October 2009, Published by Association for Computing Machinery, Inc
18.
go back to reference Keerthanaa C, Poongothai M (2016) Improved priority based scheduling algorithm forreal time embedded systems. In: 2016 International Conference on Circuit, Power and Computing Technologies [ICCPCT] Keerthanaa C, Poongothai M (2016) Improved priority based scheduling algorithm forreal time embedded systems. In: 2016 International Conference on Circuit, Power and Computing Technologies [ICCPCT]
19.
go back to reference Jensen ED, Locke CD, Tokuda H (1985) A time-driven scheduling model for real-time operating systems. RTSS 85:112–122 Jensen ED, Locke CD, Tokuda H (1985) A time-driven scheduling model for real-time operating systems. RTSS 85:112–122
20.
go back to reference Abdeddaïm Y, Chandarli Y, Masson D (2013) Toward an optimal fixed-priority algorithm for energy-harvesting real-time systems. In: RTAS 2013 WiP, pp 45–48 Abdeddaïm Y, Chandarli Y, Masson D (2013) Toward an optimal fixed-priority algorithm for energy-harvesting real-time systems. In: RTAS 2013 WiP, pp 45–48
24.
go back to reference Shi Y, Qian K (2019) LBMM: a load balancing based task scheduling algorithm for cloud. In: IEEE Future of Information and Communication Conference Shi Y, Qian K (2019) LBMM: a load balancing based task scheduling algorithm for cloud. In: IEEE Future of Information and Communication Conference
Metadata
Title
A Survey on Different Scheduling Algorithms in Operating System
Author
G. Chitralekha
Copyright Year
2021
Publisher
Springer Nature Singapore
DOI
https://doi.org/10.1007/978-981-15-9647-6_50