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
Q. Discuss the advantages as well as disadvantages of caching name translations for computers located in remote domains. Answer: There is a performance benefit to caching nam

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

MEMORY MANAGEMENT USING BIT MAPS   In this memory is separated into different allocation units each of some particular size(a few bites).consider every space of size 4k. A

Determine an imperative statement Imperative statement points out an action to be carried out during execution of assembled program

Determine the task of the Pass II In a two-pass assembler Synthesize the target program is the task of the Pass II

What are the different file operations? Create : - Space for the file in the file system update directory table. Write : - file name and data to be written is

Explain the Sleep (ms) Function  This call places the current thread in a suspended state for the number of milliseconds passed as the parameter (ms). After that Windows NT wil

Ask quesIn JavaScript, what is event handling tion #Minimum 100 words accepted#

Write a script that uses this idea to print output similar to the following: Files in this directory that match *~ : bash-scripts.html~ chimpanzee~ countdown~ countd

advantages and disadvantages of monolithic and layered approach