0
It depends of whether the current process will give up CPU to a task in the waiting state that will execute faster than itself. In this case it would be preemptive, else it would not be.
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
What is the code for shortest job first?
It is SJF.
What relation holds between priority and shortest job first algorithm?
what is the diffrnce
University solved slips for third year bsc computer science?
The university solved slips for third year Bsc Computer Science are usually issued after the students satisfy the conditions set out by the examination body. The students also have to meet the conditions set out by the senate.
Can starvation occurs in SJF?
yes in the preemptive sjf where every time the system recieve job shorter than the current it stop the current and start the new one
Is Number and variety of machines in the shop relevant to job shop scheduling?
Yes. Obviously, you have to tailor the schedule to the resources available, both human and machine, or you need to change those resources if the schedule cannot be changed.
What do you mean by non-preemptive shortest job first scheduling explain with an example?
Non pre-emptive means once CPU starts executing one process, it will not be taken out of the CPU until it is terminated or it has to wait for some event. In preemptive SJF scheduling, current running process is moved to the ready queue when a new process with a shorter CPU burst joins the ready queue.
What relation between priority and shortest job first?
Priority scheduling is a CPU scheduling algorithm where each process has a priority associated with it. Shortest job first (SJF) is a scheduling algorithm where the process with the shortest burst time is scheduled first. The relationship between the two is that a priority scheduling algorithm can be used where the priority of a process is determined by its burst time, effectively making it similar to a shortest job first algorithm.
What are the disadvantages of FCFS scheduling?
in fcfs scheduling there is a shortcoming that is if any rocess of maximum brust time is first ome. and after that many short burst time process come. then smaller pocesses have to wait for a long time untill the max brust time process complete their execution. in case of shortest job first it applied the method to give shortest t\burst time job to processer first.
How do you calculate average time for preemptive short job first scheduling?
u know man, i find it all over the net and i dont understand single thing about it.. like the India people says.. FAKE!!
What do you mean by scheduling algorithm in OS?
its the algorithm that tells the os what to process next.goes according to :shortest job firstshortest remaining time firstround robin- first in first out system
What is the Programming code for shortest job first?
What is the Programming code for shortest job first?
What is the code for shortest job first?
It is SJF.
Which of the following scheduling algorithms could result in starvation?
SJhortest job First
What are the relationships between priority and FCFS of CPU scheduling algorithms?
this is my doubt about the non-preemptive priority scheduling. i m doing bachelor of engineering in IT and this question in end semester exam. the question is as follows:Assume you have the following jobs to be executed with one processor, with the jobs arriving in the order listed here:Process Burst Time PriorityP1 80 5P2 20 1P3 10 3P4 20 2P5 50 4Suppose the system uses priority scheduling. Draw Gantt chart and calculate average waiting time for the processes.My doubt is:suppose if we were to use non-preemptive priority scheduling, the question says the jobs arriving in the order listed, so as per the order P1 will arrive first so it will get the CPU first and in non-preemptive once a job gets CPU it will not leave CPU till the process finishes, then as per the order P2 will come and same thing repeats.... so it acts like FCFS scheduling and priority is of no use here. But my lecturer says we have to follow the priority and P2 will come first, but the line the jobs arriving in the order listed is still not letting me agree with my lecturer. Can anyone help out?
Why shortest job first is fair is incorrect?
because its not fair
Dynamic job shop scheduling?
dynamic job shop scheduling is the scheduling of the machine it can processes different jobs at time. it switches from one job to another job. in real time process jobs are executed based on the time.
What is the advantage and disadvantage of preemptive scheduling algorithm?
The main advantage is that they ensure fairness to all jobs, regardless of its priority and also provide quick response time depending on the CPU time the job needs. The main disadvantage is that it provides indefinite postponement to process.
