Chapter 10, Problem 13RQ

Explanation of Solution

Deadlock:

Deadlock is the process in which two or more transactions wait infinitely for the other transaction that release the locked data item. Consider the following example:

Example:

• Transaction “T1” wants to access data items “X” and “Y” and transaction “T2” wants to access data items “Y” and “X”.
• If the transaction “T1” locks the data item “Y”, the transaction “T2” cannot starts its process.
• If the transaction “T2” locks the data item “X”, the transaction “T1” cannot continue its process.

The transaction waits for each other to unlock the data item. It is otherwise called as “deadly embrace”.

To avoid the deadlock in transactions, use the strategies of deadlock avoidance, deadlock prevention and deadlock detection.

Deadlock avoidance:

Deadlock avoidance is the process that obtains all the locks before the transaction executed. This process used to increase the response time of the transaction...