FCFS Scheduling Algorithm
Simplest CPU scheduling algorithm that schedules according to arrival times of processes. First come first serve scheduling algorithm states that the process that requests the CPU first is allocated the CPU first. It is implemented by using the FIFO queue. When a process enters the ready queue, its PCB is linked to the tail of the queue.
When the CPU is free, it is allocated to the process at the head of the queue. The running process is then removed from the queue. FCFS is a non-preemptive scheduling algorithm.
- This page demonstrates the FCFS Scheduling Algorithm using JavaScript.
- Do's and Dont's
- Do not enter special characters or symbols
- Enter required input specified
- Burst times must not be zero
Process Information
| Name | Arrival Time | Burst Time |
|---|
Gantt Chart
| Process | Start Time | End Time |
|---|
Results Table
| Process | Arrival Time | Burst Time | Completion Time | Turnaround Time | Waiting Time |
|---|---|---|---|---|---|
| Average Waiting Time: | |||||
| Average Turnaround Time: | |||||