what is deadlock ?Differentiate two types of resources ?, Basic Computer Science

• A set of process is in a deadlock state if each process in the group is waiting for an event that can be caused by only another process in the set. In other words, each member of the group of deadlock processes is waiting for a resource that can be released only by a deadlock process. Not any of the processes can run, none of them can release any resources, and not any of them can be awakened. It is significant to note that the number of processes and the number and kind of resources possessed and requested are unimportant.
• The simplest instance of deadlock is where process 1 has been allocated non-shareable resources A, say, a tap drive, and process 2 has be owed non-sharable resource B, say, a printer. At present, if it turns out that process 1 needs resource B (printer) to proceed and process 2 needs resource A (the tape drive) to proceed and these are the only two processes in the system, each one is blocked the other and all valuable work in the system stops. This state is termed deadlock. The system is in deadlock state since each process holds a resource being requested by the other process neither process is willing to release the resource it holds.
• The resources may be either physical or logical. Instances of physical resources are Printers, Tape Drivers, Memory Space, and CPU Cycles. Instances of logical resources are Files, Semaphores, and Monitors.

• Preemptable and Nonpreemptable Resources
Resources come in two types: preemptable and nonpreemptable.
A preemptable resource is one that can be taken away from the process with no ill effects. Memory is an instance of a preemptable resource. Alternatively, a nonpreemptable resource is one that cannot be taken away from process (with no causing ill effect). For instance, CD resources are not preemptable at an arbitrary instant.
Reallocating resources can determine deadlocks that involve preemptable resources. Deadlocks that occupy nonpreemptable resources are hard to deal with.
Posted Date: 5/3/2012 1:18:06 AM | Location : United States







Related Discussions:- what is deadlock ?Differentiate two types of resources ?, Assignment Help, Ask Question on what is deadlock ?Differentiate two types of resources ?, Get Answer, Expert's Help, what is deadlock ?Differentiate two types of resources ? Discussions

Write discussion on what is deadlock ?Differentiate two types of resources ?
Your posts are moderated
Related Questions
Debugging Once a program has been written, it has to be tested first to ensure that it is free of errors. It is very normal that any program written will contain mistake

Question 1 Explain with an example the three kinds of relationships that are most important in object oriented modeling Question 2 Describe the Common Modeling techniques in

Memory Management: The purpose of the memory management system is to load programs into memory in such a way as to give each program loaded  the memory that it requires for

Interpreter: An interpreter is a program that translates each statement in the programming language into machine code and runs it.  Such an arrangement means that to run the

Running on a particular treadmill you burn 3.9 calories per minute. design a program that uses a loop to display the number of calories burned after 10,15,20,25,30 minutes?

QUESTION (a) What is Multi-Protocol Label Switching (MPLS)? List the main advantage of running MPLS in a service provider network (b) What is a label? Explain the structure

Bandwidth: Bandwidth is the second concept important for transmission. This concept can be explained with the help of the traffic network mentioned earlier. If there is a two-

Design Problem 1. Implement a basic file system managed from within a file. The file system should have the following capabilities: i. List files stored along with their sizes.

These instructions permit the use of the stack to store or recover data. POP POPF PUSH PUSHF POP INSTRUCTION Purpose: It improves a portion of information from the stack POPF INST

The Scheduling algorithms can be divided into two parts with respect to how they deal with clock interrupts. 1) Nonpreemptive Scheduling: A scheduling