What Is Dead lock?

In this topic, you will learn about, What Is Deadlock? Conditions for Deadlock. Prevention And Avoidance of Deadlock.

What Is Deadlock?

Deadlock implement with scheduling and it occurs when waiting time increases during the process. There are various conditions for Deadlock.

  1. Hold and wait condition: In this condition, resources wait for processor execution. It also occurs when the process waiting for resources.
  2. Mutual Exclusive condition: In this condition, At least one resource must be specified as non-shareable status. so, we can avoid deadlock. No sharable resource automatically use when a deadlock occurs.
  3. Circular wait condition: The process in the system execute resources in the circular method then also occurs deadlock.
  4. Non-Primitive condition: In this condition, the process allocates for a resource but resources not formed. In this situation, Deadlock cannot modify and maintain.

What are deadlock prevention and avoidance?

Deadlock preventions are as follows :

  1. Deadlock prevention allows to handle system resources and minimizes waiting time.
  2. Deadlock prevention never holds a necessary condition for any task or process.
  3. It avoids any waiting or pause process.

Deadlock avoidance :

  1. For deadlock avoidance allow more concurrent control.
  2. For deadlock avoidance, avoid dynamic control or network control over resources.
  3. Deadlock avoidance also uses full information about any information or task.

Comment below if you have queries related to the above topic, What Is Deadlock? Conditions for Deadlock, Prevention, And Avoidance of Deadlock.

See also  Memory Management in Multi Programming