Can indefinite blocking take place, Operating System

Consider the subsequent resource-allocation policy. Requests as well as releases for resources are allowed at any time. If a request for resources can't be satisfied because the resources aren't available then we check any processes that are blocked waiting for resources. If they have the desired resources after that these resources are taken away from them and are given to the requesting process. The vector of the resources for which the process is waiting is increased to include the resources that were taken away. For instance consider a system with three resource types and the vector Available initialized to (4,2,2). If process P0 asks for (2, 2, 1) it gets them. If P1 asks for (1,0,1) it gets them. After that if P0 asks for (0, 0, 1), it is blocked (resource not available). If P2 now asks for (2, 0, 0) it gets the available one (1,0,0) in addition to one that was allocated to P0 (since P0 is blocked). P0's Allocation vector goes down to (1, 2, 1) and its Need vector goes up to (1, 0, 1).

a. Can deadlock take place? If you answer "yes" give an instance and If you answer "no," specify which necessary condition cannot occur.

b. Can indefinite blocking take place? Describe your answer.

Answer:

a. Deadlock cannot take place because pre-emption exists.

b. Yes A process may never obtain all the resources it needs if they are continuously pre-empted by a series of requests such as those of process C.

Posted Date: 7/27/2013 5:04:08 AM | Location : United States







Related Discussions:- Can indefinite blocking take place, Assignment Help, Ask Question on Can indefinite blocking take place, Get Answer, Expert's Help, Can indefinite blocking take place Discussions

Write discussion on Can indefinite blocking take place
Your posts are moderated
Related Questions
What is Multiprogramming? Multiprogramming is the capability of am operating system to support multiple applications running concurrently. Multiprogramming simply means that an

Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce

Define a program in execution is known as A program in execution is known as a process

Can you give me assistance on my operating system assignment?

What are batch systems? Early computers were physically huge machines run from a console. The general input devices were card readers and tape drivers. The common output device

Define spooling. A spool is a buffer that holds output for a device, like printer, that cannot accept interleaved data streams. When a request finishes printing, the spooling s

Question: a) Illustrate with the help of a diagram, the difference between two tier and three tier architectures. b) Explain in what kind of environment, a peer to peer envi

Explain Components of conflict phase of dispatch latency The conflict phase of dispatch latency has two components 1. Preemption of any process running in the kernel. 2.

Explain Deadlock Prevention-Resource allocation graph allocation Resource allocation graph algorithm :  Using this algorithm we are able to actually know if there exists in th

What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling