Operating system scheduling algorithms
First Come First Serve is the full form of FCFS. It is the easiest and most simple CPU scheduling algorithm. In this type of algorithm, the process which requests the CPU gets the CPU allocation first. This scheduling method can be managed with a FIFO queue. In FCFS Scheduling, The process which arrives first in the ready queue is firstly assigned the CPU. In case of a tie, process with smaller process id is executed first. It is always non-preemptive in nature.
Document information
- Uploaded on
- June 9, 2023
- Number of pages
- 16
- Written in
- 2022/2023
- Type
- Exam (elaborations)
- Contains
- Questions & answers