FCFS scheduling

FCFS SCHEDULING

First come first serve (FCFS) scheduling:

FCFS (First come first served ) is an operating system process scheduling algorithm that automatically executes queued requests and processes by the order of their arrival. 

With first come first served, what comes first is executed first, the next request in line will be executed once the request before it is complete. 

FCFS is also known as:

FIFO (First in first out)

FCFC (First come first choice)

·         Jobs are executed on first come, first serve basis.
·         Easy to understand and implement.

·         Average waiting time is high so poor in performance.

For example:

Job	Execution Time	Arrival Time
0	75	0
1	40	10
2	25	10
3	20	80
4	45	85

FCFS: Average waiting time calculation

SEE ALSO:

CPU Scheduling, FCFS Scheduling, Round Robin Scheduling, Gantt Chart, SRTF Scheduling, SJF nonpreemptive, SJFpreemptive, Priority Scheduling, Bankers Algorithm.

Previous pageNext page