Necessary conditions for deadlock, Operating System

Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient:

1. ?nite resources: the resources are held in a mutually-exclusive way, and they can be exhausted, causing waiting.

2. hold-and-wait: each thread holds one resource while waiting for another.

3. no preemption: threads only release resources voluntarily. No other thread (or the OS) can force the thread to release its resources.

4. circular wait: we have a circular chain of waiting threads.

Posted Date: 3/12/2013 5:29:53 AM | Location : United States







Related Discussions:- Necessary conditions for deadlock, Assignment Help, Ask Question on Necessary conditions for deadlock, Get Answer, Expert's Help, Necessary conditions for deadlock Discussions

Write discussion on Necessary conditions for deadlock
Your posts are moderated
Related Questions
Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are

What is meant by context switch? Switching the CPU to another process needs saving the state of the old process and loading the saved state for the latest process. This task is

Q. Data transfer between two processes? Communication: Data transfer between two processes is essential for some time. Both processes are on the one computer or on different

An operating system involves 3 user processes each one requiring 2 units of resource R .The minimum number of units of R like no deadlocks will ever take place is The minimum

Define Instance. An instance is an administrative unit in which components of R/3 systems giving one or more services are grouped together.  The services offered by a case are

Explain about paging? Answer: Paging is a memory-management scheme that permits the physical-address space of process to be noncontiguous. Paging avoids the considerable proble


Buddy system of memory allocation Free memory is used to maintain in linked lists, each of similar sized blocks. Every block is of size 2^k. When some memory is needed by a th

What are the differences between process and thread? The fundamental difference between a process and a thread is that a process has an entire copy of the program to itself and

what if we need the portion from a text based on some keyword. For eg. My file is like below, ------------------------------------------------ Order=[ 1 2 3 4 5 Order=[ 6 7 8 9