First Come First Serve
- Assigns CPU to the Processor which Comes first to ready state.
- It is a Non- Preemptive Algorithm that means we cannot remove processor from CPU util its task is completed.
- Here Arrival time is the processor enter into the ready state and Burst time is the time taken to execute.
- We draw Gantt Chart for processors in First Come First Serve.
- Here we Calculate completion Time using Gantt chart, Turn Around time = Waiting time + Burst time or we can calculate Turn around time by Calculating subtract from Completion Time by Arrival time.
- Waiting time we will calculate using subtraction of Turn Around Time by Burst time . And Response time is calculate we will subtract from values of Gantt chart to Arrival time.
- In Non-preemptive Scheduling waiting time and Response time is always equal.
Convey Effect
Here time taken by the processor in waiting state util another processor Completes its task.
Starvation
It is resource management problem .When the low- priority process gets jammed for a long duration of time because of high-priority requests being executed.