Deadlock || dealing with deadlock || bankers algorithm numerical || part 4 || huda academy

Описание: Notes :https://t.me/hudaacademy

Deadlock in OS refers to a situation where more than one or two processes or threads are not able to proceed because each is waiting for the other to release a resource. In other words, it's a state where a group of processes become stuck in a way that they can't make any progress

Deadlock prevention: The four necessary conditions for a deadlock situation are mutual exclusion, no preemption, hold and wait and circular set.

Deadlock avoidance:The deadlock-avoidance algorithm dynamically examines the resource-allocation state to ensure that there can never be a circular-wait condition. The resource-allocation state of a system is defined by the number of available and allocated resources, and the maximum demands of the processes.

Deadlock recovery is a critical process that is initiated after a deadlock has been detected in a computer system. This complex process involves a set of actions and procedures that are undertaken to resolve the deadlock by breaking the cycle of resource dependency between the processes involved in the deadlock.

the Operating system assumes that deadlock never occurs. It simply ignores deadlock. This approach is best suitable for a single end user system where User uses the system only for browsing and all other normal stuff. There is always a tradeoff between Correctness and performance.

Banker's algorithm is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources.