Search your topic here

Starvation in OS

STARVATION:

Starvation is phenomenon associated with the Priority scheduling algorithms which is also known as or indefinite blocking, in which a process ready to run for CPU can wait for completion of higher priority processes which is indefinitely because of low priority. Higher-priority processes can prevent a low-priority process from getting the CPU.


PROCESSES
BURST TIME
PRIORITY
P1
10
2
P2
05
0
P3
08
1

See in below table, P2 have to be wait till P1 and P2 gets completed because of its low priority. And this wait is for indefinite time. In this example few processes are taken but if we imagine heavy loaded computer system with processes than can’t say about low priority processes waiting time.

   


Difference between Deadlock and Starvation.


DEADLOCK
STARVATION
1
Also known as Circular Waiting.
Also known as Lived Lock.
2
No processes can make progress.
Others processes can progress.
3
Resources are not getting allocated.
Resources may get allocated after indefinite time.

How to solve problem of Starvation?
Aging is the solution for Starvation. In this priority of processes increases gradually which are waiting for long times.

LEAVE A REPLY