Software and Applications (non-game)

Is it possible to occur deadlock in one process during rsource allocation?


Top Answer
User Avatar
Wiki User
2008-07-26 08:02:06
2008-07-26 08:02:06

No. This follows directly from the hold-and-wait condition.

Raj Gopal Mishra (India)


Related Questions

Yes. Give it some time and it'll grow right back.

The r&r of this body component is relatively stratightforward. It involves really nothing more than finding all the clips, screws, and bolts and removing them. However, the detailed step-by-step instructions are quite lengthy and (in the manuals) are accompanied by several detailed photos. MUCH too lengthy to reproduce here and the Hayne's Manual is protected by copyright laws anyway. If you are mechanically deft you could tackle this yourself by following your intuition but I suggest that you either borrow a copy of the manual from your local library or purchase one. They are a great rsource for the DIY'er.

Deadlock situation occurs when two or more processes attempt to access resource, which is locked by another process and therefore,can't be shared.Example of a deadlock:-Traffic DeadlockResource Deadlock.Characteristics of Deadlock:-Conditions for deadlockResource Allocation Graph

yes resource allocation graph have cycles without a deadlock existing.

according to wikipendia "The Banker's algorithm is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources, and then makes a "s-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue."

It is a process... when a cant be processed

deadlock prevention is a condition in which system save yourself in going to deadlock condition where as dead recovery is sitution in which the system is in already deadlock state we recover the deadlock condition .this process is performed after deadlock occurring

Deadlock Prevention: o Preventing deadlocks by constraining how requests for resources can be made in the system and how they are handled (system design). o The goal is to ensure that at least one of the necessary conditions for deadlock can never hold. * Deadlock Avoidance: o The system dynamically considers every request and decides whether it is safe to grant it at this point, o The system requires additional apriori information regarding the overall potential use of each resource for each process. o Allows more concurrency. Similar to the difference between a traffic light and a police officer directing traffic. * Deadlock deduction:- Often, neither avoidance nor deadlock prevention may be used. Instead deadlock detection and process restart are used by employing an algorithm that tracks resource allocation and process states, and rolls back and restarts one or more of the processes in order to remove the deadlock. Detecting a deadlock that has already occurred is easily possible since the resources that each process has locked and/or currently requested are known to the resource scheduler or OS. Detecting the possibility of a deadlock before it occurs is much more difficult and is, in fact, generally undecidable, because the halting problem can be rephrased as a deadlock scenario. However, in specific environments, using specific means of locking resources, deadlock detection may be decidable. In the general case, it is not possible to distinguish between algorithms that are merely waiting for a very unlikely set of circumstances to occur and algorithms that will never finish because of deadlock. Deadlock detection techniques include, but is not limited to, Model checking. This approach constructs a Finite State-model on which it performs a progress analysis and finds all possible terminal sets in the model. These then each represent a deadlock.

A set of processes is deadlock if each process in the set is waiting for an event that only another process in the set can cause.

In Wait for Graph the request edge is a directed edge Pi → Pj which indicates that process Pj is holding a resource that process Pi needs and thus Pi is waiting for Pj to release its lock on that resource. It does not have any allocation edge.In case of Resource Allocation Graph the request edge is a directed edge Pi → Rj which indicates that process Pi is requesting resource Rj. It has an allocation edge from Rj→Pk when the resource Rj is allocated to process Pk.The way the graphs are drawn are also different but both of them are used in deadlock detection.

Easily, if threads try to access a shared resource without synchronization.

When using threads, the entire point of a reader/writer problem is to avoid deadlock and starvation. The only way to avoid deadlock or starvation without the use of semaphores is for there to be only one possible process that could run, that is one reader and one writer only.

The allocation process in a particular society's economy is the process by which the three fundamental economic questions get answered in the society.

Yes. "Deadlock" refers to a condition when a process stalls because each of its threads are waiting for another thread to do something or release control.

Deadlock PreventionDifference from avoidance is that here, the system itself is build in such a way that there are no deadlocks.Make sure atleast one of the 4 deadlock conditions is never satisfied.Deadlock AvoidanceAvoid actions that may lead to a deadlock.Think of it as a state machine moving from 1 state to another as each instruction is executed. moreoverDeadlock detection is a technique to handle deadlocks which tries to find out if the system is in deadlock and then works to recover it from the deadlock if any exists. It is used as an afterthought and is not coordinated with the resource allocating procedures.Deadlock avoidance is a technique which works hand-in-hand with the resource allocation and tries to ensure that a resource request made in a non-deadlocked state is granted only if it will not lead to a deadlock in the future. This technique however makes unrealistic demands about the kind of information it needs from process, in that, it requires the entire pattern of resource requests, past & future.

the coordinator conculde incorrectly that a deadlock exist and kills some process --------------------------- Detecting a non existent deadlock in distributed system has been referred as false deadlock and it may occur due to communication delay.. ---->Ashok Paranjothi

How the opportunity cost can be applied to the production process for the allocation of resources. How the opportunity cost can be applied to the production process for the allocation of resources.

Resource allocation is the process and decision of allocating money to a specific project or business unit.

An allocation is a process or procedure of allocating things, especially money or resources.

The difference is exactly what you have just stated: deadlock prevention is used to stop deadlocks before they happen (to prevent them), while deadlock detection is used to figure out when a process has deadlocked (to detect it).

Deadlock: Two processes are said to be in deadlock situation if process A holding onto resources required for process B and where as B holding onto the resources required for process A. Starvation: This is mostly happens in time sharing systems in which the process which requires less time slot is waiting for the large process to finish and to release the resources, but the large process holding the resources for long time (almost for forever) and the process that requires small time slot goes on waiting. Such situation is starvation for small process

DEADLOCK:1) Deadlock process is permanently blocked because the required resource never becomes available.2) The resource under contention is not in continuous use.STARVATION:1) In starvation, it is not certain that a process will ever get the requested resources.2) the resource under contention is in continuous use.

deadlock is a part of transaction .when a transaction is going on in that time deadlock is occur.then handle the deadlock use some techniques is called the deadlock detection algo.

The action or process of allocating or distributing something

Contiguous memory allocation in C programming refers to the assigning of consecutive memory blocks to a process. Contiguous memory allocation is one of the oldest and most popular memory allocation schemes in programming.

Copyright ยฉ 2020 Multiply Media, LLC. All Rights Reserved. The material on this site can not be reproduced, distributed, transmitted, cached or otherwise used, except with prior written permission of Multiply.