mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-02-13 21:42:29 +00:00
[FEATURE] Add Preemptive Priority Scheduling Algorithm #174
Reference in New Issue
Block a user
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Originally created by @dilipkjain on GitHub (Oct 5, 2023).
Detailed description
Algorithm
Preemptive Priority Scheduling Algorithm
Type
Process Scheduling Algorithm
Description
The preemptive priority CPU scheduling algorithm uses a rank-based system to define a rank for each process, where lower rank processes have higher priority and higher rank processes have lower priority. The preemptive priority CPU scheduling algorithm decides the priority of a process based on its rank. The scheduler selects the first process whose arrival time is 0 because that process is only executing at time t=0. Then it checks the priority of the next available process. If the current process has a higher priority than the previous one, then it executes the current process. If the current process has a lower priority than the previous one, then it executes the previous one. If both processes have equal priorities, then it executes the one that arrived first.
Context
A process scheduling algorithm, preemptive in nature i.e., the CPU is allocated to the processes for a limited time only.
The preemptive priority CPU scheduling algorithm uses a rank-based system to define a rank for each process, where lower rank processes have higher priority and higher rank processes have lower priority. The preemptive priority CPU scheduling algorithm decides the priority of a process based on its rank. The scheduler selects the first process whose arrival time is 0 because that process is only executing at time t=0. Then it checks the priority of the next available process. If the current process has a higher priority than the previous one, then it executes the current process. If the current process has a lower priority than the previous one, then it executes the previous one. If both processes have equal priorities, then it executes the one that arrived first.
Possible implementation
Add Preemptive Priority Scheduling Algorithm in Process Scheduling Folder
Additional information
No response
@spideyWebb commented on GitHub (Oct 8, 2023):
Hi I am good at c language. Will you please assign me this issue.
@Gunjan-Rajput commented on GitHub (Oct 27, 2023):
please assign me this issue.
@SarojArchana commented on GitHub (Nov 21, 2023):
@dilipkjain I have Added Preemptive Priority Scheduling Algorithm in Process Scheduling Folder can you please review my PR
@github-actions[bot] commented on GitHub (Dec 22, 2023):
This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
@github-actions[bot] commented on GitHub (Dec 30, 2023):
Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!