Deadlock: It is a condition in which two or more processes are blocked from progressing because each is waiting for a resource that is allocated to another. Deadlock cannot occur unless all three of the following conditions are satisfied: There is competition for non-sharable resources. The resources are requested on a partial basis; that is, having received some resources, a process will return later to request more. Once a resource has been allocated, it cannot be forcibly retrieved.

Question

Want to see the full answer?

Answer 1

Question

Chapter 3, Problem 37CRP

Program Plan Intro

Deadlock:

It is a condition in which two or more processes are blocked from progressing because each is waiting for a resource that is allocated to another.

Deadlock cannot occur unless all three of the following conditions are satisfied:

There is competition for non-sharable resources.

The resources are requested on a partial basis; that is, having received some resources, a process will return later to request more.

Once a resource has been allocated, it cannot be forcibly retrieved.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Exercise 2: Draw a State machine Diagram for a Telephone line (a process in a smartphone OS) with the following behavior: When the telephone app is not active, the telephone line is idle. When the app is activated, the line gives a dial tone and can accept the dialing of digits. If after getting the dial tone, the user doesn't dial a number within a time interval of 10 seconds, then a time-out occurs, and the line gets idle again. A button on the app can re- activate the line. After dialing a number, if the number is invalid then a recorded message is played at the end of which the line becomes idle. Upon entry of a valid number, the phone app tries to connect a call & routes it to the proper destination. If the called person answers the phone, the conversation can occur, and the line is in an on- call state. When the called person hangs up, the phone app disconnects and the line goes to the idle state.

Consider a computer system which has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in any way that is, two in one shot or one by one. The system always satisfies a request for a resource if enough resources are available. If the processes don't request any other kind of resource, show that the system never deadlocks?

Consider a system consisting of 5 processes, P = {P1, P2, P3, P4, P5} and 3 resources types, R = {R1, R2, R3}. The number of instances for each resource type are 2, 2 and 1 respectively. The state of the system at time, it is described as follow: P1 requests an instance of R2 P2 requests an instance of R1 P3 requests an instance of R2 and holds an instance of R1 and an instance of R3 P4 requests an instance of R3 P5 holds all instances of R2 Assuming that all resources are non-sharable, construct a Resource Allocation Graph to depict the process state.