Consider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as :
= 1 +
/
Using the data given below compute the waiting time and turnaround time for each process and average waiting time and average turnaround time.
Process Arrival time
P1 0
P2 5
P3 13
P4 17
Answers
Answer:
The scheduling in computers are done on basis of several algorithms, they are preemptive and non-preemptive algorithm. In non-preemptive the process once starts executing, needs to be completed before releasing the CPU, and preemptive is just vice-versa.
Explanation:
In a computer system there are many processes, waiting to be processed, and this process is done by the CPU. Now which process shall be processed in which instance of time, and when the other process is to be allocated CPU time, is provided in the scheduling algorithms, programmed in OS.
Answer:
Non preemptive scheduling is type of the running process which cannot be interrupted by the other process is known as the non preemptive scheduling.
It allows taking sample to apply a non preemptive process to it.
Here the P2 found at the time of 0 and it is allocated in the CPU to complete the execution.
Therefore the student will help to get best ideas of it.