We need a scheduling policy when we have many jobs to run
Or we are limited and resources it needs to solve three limitations of the system
A there are a finite number of resources
Such as disk drives apprentice be
there are locked resources so they cannot be shared with another job
And see some resources may need the user to
reassign jobs we want a policy that can deliver the maximun throughput
Provide quicker responses and ensure fairness for
all jods while also maintaining inefficient CPU service
One thing we surely donapost want he&aposs a resource hog
this means a job can be very selfish
And make you some all the resources and not share them out
We may need to intervene to make sure we can get a hold of resources for
Ourselves
So we need a predefined point to intervene
Incorporating time slicing or priorities have jobs
Presents two types of schedulers known as both
Preemptive this means giving the power to interrupt the job
Or non preemptive meaning we have to wait for the job to complete
Before we can do anything a processor schedule a