'Sec throughput' presentation slideshows

First Come, First Served (FCFS)

First Come, First Served (FCFS). The simplest algorithm When a process becomes ready, it enters the FIFO queue. When the currently-running process ceases to execute, the oldest process in the queue is selected for running. Non-preemptive. FIFO Ready Queue. CPU. dispatched.

1.12k views • 24 slides