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

Describe the strategies adopted by the ministry of ict, Question 1: (a)...

Question 1: (a) Planning and management of ICT projects have a very poor record in developing countries. Briefly explain five critical success factors for correct implementa

Describe association design of an object, Describe association design of an...

Describe association design of an object by giving one suitable example of it. The Design of Associations Associations are "glue" of advanced object oriented analysis and

Example of primary key, Suppose that in an organisation, an employee may do...

Suppose that in an organisation, an employee may do different roles in dissimilar projects. Say, RAM is doing coding in one project and doing designing in another. Suppose that the

Sorting field groups we cannot use more than one key field, While sorting f...

While sorting field groups we cannot use more than one key field False.

Greater potential for bugs and increased processing overhead, Greater poten...

Greater potential for bugs: Since the sites of a distributed system operate simultaneously, it is more complex to ensure the correctness of algorithms. The art of constructing dis

find a non-redundant cover and canonical cove, Given the following set of ...

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

Give expression in tuple calculus and domain calculus, Consider the subsequ...

Consider the subsequent relation schemes:  Project (Project#, Project_name, chief_architect)  Employee (Emp#, Empname)  Assigned_To (Project#, Emp#)  Give expression i

Define union compatibility, Define union compatibility? Explain why INTERSE...

Define union compatibility? Explain why INTERSECTION of two relations cannot be performed if they are not union compatible? Two relations R(A1, A2,-------, An) and S(B1, B2,--

Relational operations, Let us now talk about the relational operations: ...

Let us now talk about the relational operations: SELECT The select operation is used to select few specific record from the database based on different criteria, This is a un

How many types of users works on database, How many types of users works on...

How many types of users works on database? Users are differentiated through the way they expect to interact along with the system (i) Application programmers-interact with

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