of ProcessesĪverage Waiting Time = Total Waiting Time / Total No. So, if the OS follows the FCFS algorithm for scheduling these processes, then they will be executed in the following manner:Īverage Turn Around Time= Total Turn Around Time / Total No. Suppose there are four processes with process ID's P1, P2, P3, and P4 and they enter into the CPU as follows: Process ID Now let us try to understand this further with the help of an example. It simply follows the strategy of "First come First serve with special services provided to none." In the FCFS algorithm, the process gets executed in the same sequence in which they enter the Ready state. Thus, the concept of priority and urgency is not implemented. The FCFS, which stands for First Come First Serve Scheduling Algorithm, is a non-preemptive scheduling algorithm, which means that if a process once starts executing in the processor, then it cannot be preempted in between the processing. Thus, the concept of priority and urgency is not implemented by this type of algorithm. Submitted by Monika Sharma, on June 22, 2019. Submitted by Monika Sharma, on June 22, 2019 We will first define it briefly and will then also illustrate it with the help of an example. First Come First Serve Scheduling Algorithm. In this article we are going to study about the FCFS, i.e. This article is about one of the Scheduling Algorithms in Operating System.
0 Comments
Leave a Reply. |