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

What is cross product, What is Cross Product? Simply Cross product is B...

What is Cross Product? Simply Cross product is Binary Operator

Management information system, Explain the challenges before an E-business ...

Explain the challenges before an E-business management.

Define two-phase locking protocol, Define two-phase locking protocol. A...

Define two-phase locking protocol. Ans: Two-phase locking is significance in the context of ensuring that schedules are serializable. The two-phase locking protocol defines a p

Describe the four main ways of optimising disk block access, Describe the f...

Describe the four main ways of optimising disk block access. Ans: a. Disk  b. Non-volatile writes buffers c. File organization (Clustering) d. Log-based file system

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.

State the steps of object design, State the Steps of Object Design ...

State the Steps of Object Design Object design is a very iterative process in which various classes, relationships among objects are added when you move from one level to

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

Security-drawbacks of data distribution, Security: In a centralised system...

Security: In a centralised system, access to the data can be simply controlled. Though, in a distributed DBMS not only does access to replicated data have to be controlled in many

Differentiate between natural join and outer join, Differentiate between na...

Differentiate between natural join and outer join? Natural join is a binary operator which is written as (R * S) where as R and S are relations. The output of the natural join

Finkelstein methodology, PART MARKING: For this section, we will use part m...

PART MARKING: For this section, we will use part marking. This means we will supply model answers to all questions but we will only mark six questions. We will choose these randoml

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