fcfs调度算法_FCFS：先来先服务调度算法

fcfs调度算法

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. In the FCFS algorithm, the process gets executed in the same sequence in which they enter the Ready state. It simply follows the strategy of "First come First serve with special services provided to none."

FCFS代表先来先服务调度算法 ，是一种非抢先调度算法，这意味着，如果某个进程一旦开始在处理器中执行，则无法在进程之间抢占该进程。 因此，这种算法无法实现优先级和紧急度的概念。 在FCFS算法中，进程以进入就绪状态的顺序执行。 它只是遵循“先到先得，不提供特殊服务”的策略。

Now let us try to understand this further with the help of an example. Suppose there are four proc