17CS64/18CS43 - Preemptive Priority Scheduling Algorithm - Operating System
Hi Viewers,
17CS64/18CS43 - Preemptive Priority Scheduling Algorithm - Operating System
4th Semester & 6th Semester CSE/ISE
Preemptive Priority Scheduling Algorithm
Priority Scheduling is a method of scheduling processes that is based on priority. In this algorithm,
the scheduler selects the tasks to work as per the priority.
The processes with higher priority should be carried out first, whereas jobs with equal priorities are
carried out on a round-robin or FCFS basis. Priority depends upon memory requirements, time. requirements, etc.
Preemptive Scheduling
In Preemptive Scheduling, the tasks are mostly assigned with their priorities. Sometimes it is important to run a
task with a higher priority before another lower priority task, even if the lower priority task is still running.
The lower priority task holds for some time and resumes when the higher priority task finishes its execution.
Operating System - Website Link
https://hemanthrajhemu.github.io/CSE6...
Credit
Future Vision BIE
Mr K B Hemanth Raj
Also find all study Material in Future Vision BIE
Official Website: https://hemanthrajhemu.github.io/
Follow us on:
Instagram :
Official ID: / futurevisionbie
Personal ID: / hemanthraj_hemu
Mail US @
[email protected]
Watch video 17CS64/18CS43 - Preemptive Priority Scheduling Algorithm - Operating System online without registration, duration hours minute second in high quality. This video was added by user Future Vision Bie 29 June 2020, don't forget to share it with your friends and acquaintances, it has been viewed on our site 20 once and liked it people.