Scheduling (Algorithms) Policies (Priority): These are the following different types of common policies or algorithms: 1) First Come First Served (FCFS) scheduling: This is non-preemptive technique. A single queue of ready processes is maintained, and the dispatcher always picks the first one. This method does not emphasize throughput, since long processes are allowed to monopolize CPU, For the same reason, the response time with FCFS can be high (with respect to execution time), especially if there is a high variance in process execution times. This is also known FCFS scheduling. Consider the following example of two processes- In the several processes come on different job p1, p2 and p3 respectively, here p2 and p3 jobs required less than or comparatively p1 process (job), but computer run p1 process in the process of FCFS scheduler. P2 and p3 process has in ready queue in waiting process state. Advantages: These are the following advantag...
Comments
Post a Comment
Thank you for message