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

ER diagram, #question. acompani datdbase needs to store information about e...

#question. acompani datdbase needs to store information about employees (identified by a social security number,with salary and phone as attributes) and departments (identified by

Er diatgrams, Ask q“A database will be made to store information about pati...

Ask q“A database will be made to store information about patients in a hospital. On arrival, each patient’s personal details (name, address, and telephone number) are recorded wher

Explain the three data anomalies, What are the three data anomalies that ar...

What are the three data anomalies that are similarly to take place as a result of data redundancy?  Can data redundancy be completely eliminated in database approach?  Why or why n

What are the parts of sql language, What are the parts of SQL language? ...

What are the parts of SQL language? The SQL language has various parts: data - definitition language  Data manipulation language  View definition  Transaction contr

Describe file organisation, Describe file organisation? A file is organ...

Describe file organisation? A file is organized logically as a sequence of records. These records are mapped onto disk blocks. A) Fixed-Length Records Type deposit=record

Distributed transaction atomic-consistent-isolated, A distributed transacti...

A distributed transaction consists of subtransactions that execute at different sites and access local DBMSs at those sites. For example, a distributed transaction that transfers m

Normalization e, explain normalization,and give the examples 1NF,2NF,3NF,BC...

explain normalization,and give the examples 1NF,2NF,3NF,BCNF.AND FUNCTIONAL DEPANDENACY AND DECOMPOSITION TECHNIQUES.

Transaction, .#question. Discuss the problem which may arise during concurr...

.#question. Discuss the problem which may arise during concurrency control and recovery in distributed database which are not encountered in controlized database environment.

Define seek time, Define seek time. The time for repositioning the arm ...

Define seek time. The time for repositioning the arm is known as the seek time and it enhances with the distance that the arm is known as the seek time.

Fragmentation, Differentiate between horizontal & mixed horizontal fragment...

Differentiate between horizontal & mixed 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