> a) Deadlock is an extreme case of hunger
> b) Deadlock and hunger are two unrelated concepts
> c) Hunger will only lead to deadlock
Starvation: When a low-priority process cannot access the required resource, because there is a high-priority process that accesses the resource. In this case, the entire process system has not stopped.
Because, only Low-priority processes cannot access hungry resources, and no process can access the resources they need in a deadlock. Therefore, deadlock is an extreme case of starvation. The extreme standard is the total number of inaccessible processes. Resources.
Deadlock and starvation are related, because both are situations where a process cannot access resources.
Starvation does not cause a deadlock, because a hungry low-priority process has been waiting while the other has high The priority process will be completed.
There are rumors that when they shut down IBM 7094 at the Massachusetts Institute of Technology in 1973, they discovered a low-priority process, which was already in 1967. Submitted but not yet run. ‡
‡ Abraham Silberschatz mentioned in the Operating System Concepts book, Peter B. Galvin, Greg Gagne
I know it’s dead The definition of lock and hunger, but I am still confused about these points (can’t figure out which one is correct)
> a) Deadlock is an extreme case of hunger
> b ) Deadlock and hunger are two unrelated concepts
> c) Hunger will only lead to deadlock
Deadlock: when all processes cannot access resources , Because each process is waiting for another process and there is a loop.
Starvation: When a low-priority process cannot access the required resources, because there is a high priority to access resources Process. In this case, the entire process system has not stopped.
Because, only low-priority processes cannot access starved resources, and no process can access the resources they need in the deadlock, so the deadlock It is the extreme case of starvation. The extreme criterion is the total number of inaccessible processes. Resources.
Deadlock and starvation are related, because both are processes inaccessible Access to resources.
Starvation does not cause deadlock, because a hungry low-priority process has been waiting, while other high-priority processes will complete.
Rumor has it that when they shut down IBM 7094 at MIT in 1973, they discovered a low-priority process that was submitted in 1967 but not yet running. ‡
‡Abraham Silberschatz mentioned in the Operating System Concepts book, Peter B. Galvin, Greg Gagne