L'algorithme d’ordonnancement FCFS (FIFO) 1

In this algorithm, known as FIFO (First In, First Out), processes are placed in the ready queue according to their arrival order. The rules governing this scheduling are: When a process is ready to execute, it is placed at the end of the ready queue. When the processor becomes free, it is allocated to the process at the front of the ready queue. The selected process releases the processor if it terminates or requests I/O.