References:
7.1 System Model
7.2 Deadlock CharacterizationNew Sidebar in Ninth Edition Show
7.3 Methods for Handling Deadlocks
7.4 Deadlock Prevention
7.5 Deadlock Avoidance
7.6 Deadlock Detection
7.7 Recovery From Deadlock
7.8 SummaryWhat is a safe state when can a deadlock happen?A state is safe if the system can allocate all resources requested by all processes ( up to their stated maximums ) without entering a deadlock state.
What is safe sequence and safe state in deadlocks?A state of the system is called safe if the system can allocate all the resources requested by all the processes without entering into deadlock. If the system cannot fulfill the request of all processes then the state of the system is called unsafe.
When using the banker's algorithm an operating system must be sure never to satisfy a request that moves it from a safe state to an unsafe one?When using the Banker's Algorithm, an operating system must be sure never to satisfy a request that moves it from a safe state to an unsafe one. Although the Banker's Algorithm has been used to avoid deadlocks in systems with a few resources, it isn't practical for most systems.
What is the weakness of the banker algorithm?Disadvantages of the Banker's Algorithm
It requires the number of processes to be fixed; no additional processes can start while it is executing. It requires that the number of resources remain fixed; no resource may go down for any reason without the possibility of deadlock occurring.
|