Linux
FCFS, or First-Come, First-Served, is a scheduling algorithm commonly used in various operating systems, including Unix,
Linux, and
Windows. It is a simple, non-preemptive scheduling method where processes are executed in the order they arrive in the ready queue. While it is not the most efficient for time-sharing systems due to potential long wait times, it is easy to implement and can be found in many basic operating systems and environments.
