Hello friends, In this blog post I am going to let you about the problem of starvation which is also known as indefinite postponement, indefinite blocking or starvation.
In any system that keeps processes waiting while it makes resources allocation and process scheduling decisions, it is possible to delay indefinitely the scheduling of a process while other processes receive the system attention. This results in a situation like starvation.
indefinite may occur because of biases in a system’s resource scheduling policies. When resources are scheduled on a priority basis, it is possible for a given process to wait for resources indefinite as processes with higher priority continue arriving. Waiting is an important aspect of what goes on inside the computer system.
The system should be designed to manage the waiting process fairly as well as efficiently. In some systems, indefinite postponement is prevented by allowing a process’s priority to increase as it waits for a resource. This is called aging. Eventually, that process’s priority will exceed the priorities of all incoming processes, and the waiting process will be serviced.
Difference between deadlock and starvation:
Deadlock is a situation where a process is waiting for an event that will never occur. Whereas starvation is a situation where a process is waiting for an event that occurs but is always affecting other processes.
Similarities between deadlock and starvation:
In both deadlock and starvation, a process is waiting for an event to occur.
In the case of any queries, you can write to us at email@example.com we will get back to you ASAP.
Hope! you would have enjoyed this post about starvation, indefinite postponement, indefinite blocking, and deadlock.
Please feel free to give your important feedbacks in the comment section below.
Have a great time! Sayonara!