Define deadlock term, Database Management System

a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them.

b. Outline an algorithm that detects whether there is a deadlock. The algorithm should be able to cope with multiple types of resources, each type having a limited number of units available.

c. When should the algorithm be invoked? The answer to this question may depend on system characteristics such as the rate of resource requests, the granularity of resources, and the expected rate of deadlock. List three possible choices and discuss the criteria you would use to choose among them.

 

Posted Date: 3/18/2013 6:15:00 AM | Location : United States







Related Discussions:- Define deadlock term, Assignment Help, Ask Question on Define deadlock term, Get Answer, Expert's Help, Define deadlock term Discussions

Write discussion on Define deadlock term
Your posts are moderated
Related Questions
What will be create when a primary key if combined with a foreign key? A primary key if combined with a foreign key it creates Parent-Child relationship between the tables that

Explain weak and strong entity type ? Weak and Strong entity type: An entity set which does not have a primary key is referred to as a weak entity set. The existence of a wea

What is document scanning and imaging? Document scanning and imaging, or digital archiving, is the method of scanning a document into a digital image to archive and retrieve a

What is the purpose of storage manager? The storage manager is responsible for the following a) Interaction with the file manager b) Translation of DML commands in to low

What are called journaling file systems? File systems that support log disks are known as journaling file systems.

explain exhaustively the problems associated with ER diagrams. include illustrations in your answer

Rearrange the Execution Order for Efficiency  Rearranging execution order for efficiency means executing such job that requires less execution time. By rearranging the object

2NF Normal Form : A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2N

I have a homework assignment due today by midnight. I need help understanding databasse normalization and determining the type of form violation & how to fix the violation.

Difference between LEFT OUTER JOIN and RIGHT OUTER JOIN In left outer join tuples from the left-hand-side relation which do not match any tuple in the right-hand-side relation