0
823views
What are preemptive and non-preemptive algorithms?
1 Answer
written 2.7 years ago by | modified 2.7 years ago by |
Preepmtive | Non-preemptive |
---|---|
1. Resources allocated toprocess for limited time. | 1. Resources alotted till process is complete/switches to waiting. |
2. Processes can be interrupted. | 2. Process cannot be interrupted. |
3. Low priority process maystarve. | 3. Short timed process may starve. |
4. Has overheads. | 4. No overheads. |
5. Flexible. | 5. Rigid. |
6. Cost associated. | 6. Not cost associative. |
7. Waiting time, Response timeis less | 7. Waiting time, Response time ismore. |
SRTF (Shortest Response Time First) Priority Round Robin |
FIFO / FCFS SJF (Shortest Job First) Priority - Multilevel Queue Scheduling - Multilevel Feed-back Queue Scheduling |