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

Explain query tree represent relational algebra expression, How does a quer...

How does a query tree represent a relational algebra expression?      Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is

Modular growth, Modular growth: In distributed environments, it is simple t...

Modular growth: In distributed environments, it is simple to expand. Latest sites can be added to the network without affecting the operations of other sites, as they are somewhat

What are the concurrency issues, Concurrency issues Data integrity...

Concurrency issues Data integrity: Threads accessing same object need to be synchronized, such as: banking account. Deadlock: One or more threads in system are perman

Illustrate about the advanced object design, Illustrate about the advanced ...

Illustrate about the advanced object design Advanced object design is a complex task. The objects discovered through analysis serve as a skeleton of design. The operations reco

Explain the weak entity set, Explain the Weak Entity Set An Entity set...

Explain the Weak Entity Set An Entity set which does not have sufficient attribute to make a primay key is known as weak entity set. For instance, dependents of an employee in

What is an index, What is an Index? An index is a small table having on...

What is an Index? An index is a small table having only two columns. The first column has a copy of the primary or candidate key of a table and the second column having a set o

Storage of database on hard disks, Storage Of Database On Hard Disks At...

Storage Of Database On Hard Disks At this point, it is worthwhile to note the difference among the terms file Organisation and the access method. A file organisation shows to t

Er diagram, Design a generalization–specialization hierarchy for a motor-ve...

Design a generalization–specialization hierarchy for a motor-vehicle sales company. The company sells motorcycles, passenger cars, vans, and buses. Justify your placement of attrib

Benefits and drawbacks of heap files, Benefits of heap files 1.   This i...

Benefits of heap files 1.   This is a easy file Organisation method. 2.   Insertion is somehow capable. 3.   Good for bulk-loading data into a table. 4.   Best if file

What are the two integrity rules, What are the two integrity rules?  An...

What are the two integrity rules?  Ans:  The two integrity rules are: Entity Integrity Rule & Referential Integrity Rule.   Entity Integrity Rule - If the attribute A of rel

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