Operating System Deadlock Strategies

Questions and Answers

Protecting non-sharable resources from simultaneous access (correct)

Guaranteeing process execution without waiting

Preventing resource starvation

Ensuring low resource utilization

Imposing a total ordering of all resource types and requesting resources in an increasing order of enumeration

No preemption

Hold and wait (correct)

Require process to request and be allocated all its resources before it begins execution

Process starvation

High resource utilization

Increased process execution time

Low resource utilization (correct)

To prevent circular wait Signup and view all the answers

The resources being held are released and added to the list of waiting resources Signup and view all the answers

It is not applicable in most systems Signup and view all the answers

To prevent deadlocks and ensure system stability Signup and view all the answers

It is a necessary condition for deadlock Signup and view all the answers

System instability Signup and view all the answers

To coordinate access to shared resources Signup and view all the answers

Study Notes

There are three methods to handle deadlocks: deadlock prevention, deadlock avoidance, and deadlock recovery

Ensure that at least one of the necessary conditions for deadlocks does not hold
Methods to prevent deadlocks:
- Mutual Exclusion: cannot be used for prevention
- Hold and Wait: guarantee that a process does not hold any other resources when requesting a resource
- No Preemption: not practical for most systems
- Circular Wait: impose a total ordering of all resource types and require that each process requests resources in an increasing order of enumeration

A system consists of resources, such as CPU cycles, memory space, and I/O devices
Each resource type has multiple instances
Each process utilizes a resource by requesting, using, and releasing it
Resources can be physical or logical

Develop a description of deadlocks, which prevent sets of concurrent processes from completing their tasks
Present methods for preventing or avoiding deadlocks in a computer system