What are deadlocks, Database Management System

Assignment Help:

What are deadlocks?  How can they be avoided?

 Ans: Deadlock considers to a particular condition when two or more processes are every waiting for another to release a resource, or much more than two processes are waiting for resources in a circular chain. Deadlock is a general problem in multiprocessing in which many processes share a particular type of mutually exclusive resource termed as a software, or soft, lock. Computers that are intended for the time-sharing and/or real-time markets are often equipped along with a hardware lock (or hard lock) that assures exclusive access to processes, forcing serialization. Deadlocks are specifically troubling as there is no general solution to avoid (soft) deadlocks.

One of the techniques of deadlock avoidance related to timestamps there are two types: wait-die and wound-wait.


Related Discussions:- What are deadlocks

Key to represent relationship between tables is called, Key to represent re...

Key to represent relationship amongs tables is called ? A Key that represent the relationship between tables is called Foreign Key.

Ideal data dictionary, An ideal data dictionary should have everything a DB...

An ideal data dictionary should have everything a DBA wants to know about the database. 1 Conceptual, External, and internal database descriptions. 2.    Descriptions of attr

ER diagram, construct an er diagram for a hospital with a set of patients a...

construct an er diagram for a hospital with a set of patients and a set of medical doctors. associate with each patient a log of various test and examination conducted.convert er d

Design and building a distributed information system, prototype of a distri...

prototype of a distributed information system for a national car part retail outlet chain.

Heuristics, Benefits of using heuristics

Benefits of using heuristics

Which operator is cartesian product in relational algebra, Which operator i...

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

Correlated and uncorrelated queries, need to get answer for questions 3&4 o...

need to get answer for questions 3&4 on this page in part 1

Assignment, Research Value: 7% Due Date: 17-Sep-2018 Return Date: 11-Oct-2...

Research Value: 7% Due Date: 17-Sep-2018 Return Date: 11-Oct-2018 Length: 700 words Submission method options: Alternative submission method Task back to top You are required to

Explain projection operation distribute over union operation, Illustrate th...

Illustrate the statement 'Projection operation distributes over the union operation'. Give an example.    Ans: Π L (E 1 ∪ E 2 ) = (Π L (E 1 )) ∪ (Π L (E 2 ))   This says th

Fragmentation, let us consider a table having 2200 records and the fixed si...

let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd