Describe different job scheduling in operating systems.

Answer Posted / sravan reddy

1)Pre-emptive:- forcibly removing a process from its running
state to avoid starvation so that shorter jobs also get a
time slice for execution.
2)Non-Preemptive:-
jobs cannot be pre-empted unless they complete their job.
3)Priority based:-
suppose we have more than one job and each job is having its
own priority then the job having highest priority gets
executed first..
4)Priority Inversion:-
In this method we can change the priority of the current
executing process
5)Round-robin:-round-robin policy is a method in which every
process gets its time slice..
after executing a process for certain time slice..if the job
is not completed in that time it will be thrown into waiting
state and the next job gets the timeslice and will be
executed..and the process that was in waiting state will get
processor time after the remaining processes are completed..
6)First In First Out(FIFO)
or
First Cum First Serviced(FCFS):-Name itself indicates that
whatever the job came first will be executed first..
there is a queue called Job queue which has a record of all
the jobs to be executed and using FIFO each job gets out of
that queue and executed as a queue..
7)Interrupt based:-
Interrupts have high prority than any other process..
so they will be executed first..

inorder to understand all the things i explained..First get
the information about the process states..How jobs will be
Executed?what is ready queue?what is context switching? etc
etc..

Is This Answer Correct ?    19 Yes 1 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

No New Questions to Answer in this Category !!    You can

Post New Questions

Answer Questions in Different Category