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
Explain Structure The Grammar for programming language is a formal description of Structure

Remote IT Support Engineer Windows Systems Administrator Project Description: Need Windows base IT Support Engineer / Systems Network Administrator - perfectly MCSE qualified

Identifying parallelism A formal way to identify parallelism in an activity is to draw a task dependence graph in a directed graph in which each vertex represents a task to

Explain the Thread Local Storage (TLS)    Windows NT provides unique functions for per-thread data management. Thread local storage (TLS) is a concept defined in NT so develope

Linked list allocation: At this time the blocks are stored using linked lists. The block size require not be the same. Thus internal fragmentation is avoided. Consider

General Graph Directory A serious trouble with using an acyclic graph structure is making sure that there are no cycles. When links are further added to an existing tree struc

#question After working for 30 years, Ramjee Somjee Dutt opted for VRS and started a courier company and did very well in the first four years. He was now looking for expansion of

What is co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o

Determine how Action implementing instruction’s meaning are a actually carried out   Action implementing meaning of instruction are a actually carried out Instruction executio

what are the main advantages of multiprogramming