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
Write a short note on peer-to-peer computing. Peer-to-peer (P2P) system model is a kind of distributed OS. In this model, clients and servers aren't distinguished from one anot

What is indexed allocation? Every file has its own block of pointers to the sectors of the file.

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

What is a Latency Time Latency Time is the time required through a sector to reach below read/write head.

When a computer is started on, the program that executed first is named the ''operating system.'' It controls pretty much all applications in the computer. This adds who logs in, h

Q. Why is it complicated to protect a system in which users are allowed to do their own I/O? Answer: In earlier chapters we identified a distinction among kernel and user mod

Suppose your process starts up, and allocates some memory with malloc(). The allocator will then give part of a memory page to your process. The OS then updates the corresponding p

Q. Is disk scheduling except FCFS scheduling useful in a single-user environment? describe your answer. Answer: In a single-user environment the I/O queue typically is empty.


Explain in detail about ipc in linux