In this scheduling algorithm, the scheduler picks the threads thar arrive first in the runnable queue. Observe the following table:
| Threads |
Time of Arrival |
| t1 |
0 |
| t2 |
1 |
| t3 |
2 |
| t4 |
3 |
In the above table, we can see that Thread t1 has arrived first, then Thread t2, then t3, and at last t4, and the order in which the threads will be processed is according to the time of arrival of threads.
Hence, Thread t1 will be processed first, and Thread t4 will be processed last.
