Facts: Facts about Deadlock Deadlock is a situation that occurs in OS when any process enters a waiting state because another waiting process is holding the demanded resource. Deadlock is a common problem in multi-processing where several processes share a specific type of mutually exclusive resource known as a soft lock or software. Deadlock is a situation where a process or a set of processes is blocked, waiting for some other resource that is held by some other waiting process. It is an undesirable state of the system. The following are the four conditions that must hold simultaneously (Links to an external site.) for a deadlock to occur. Mutual Exclusion – A resource can be used by only one process at a time. If another process requests for that resource then the requesting process must be delayed until the resource has been released. Hold and wait – Some processes must be holding some resources in nonshareable mode and at the same time must be waiting to acquire some more resources, which are currently held by other processes in non-shareable mode. No pre-emption – Resources granted to a process can be released back to the system only as a result of voluntary action of that process, after the process has completed its task. Circular wait – Deadlocked processes are involved in a circular chain such that each process holds one or more resources being requested by the next process in the chain. Question(s): 1. Give one real-life example in Computers of Deadlock and how to prevent it from occurring?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Facts:

Facts about Deadlock

Deadlock is a situation that occurs in OS when any process enters a waiting state because another waiting process is holding the demanded resource. Deadlock is a common problem in multi-processing where several processes share a specific type of mutually exclusive resource known as a soft lock or software.

Deadlock is a situation where a process or a set of processes is blocked, waiting for some other resource that is held by some other waiting process. It is an undesirable state of the system. The following are the four conditions that must hold simultaneously (Links to an external site.) for a deadlock to occur.

Mutual Exclusion –
A resource can be used by only one process at a time. If another process requests for that resource then the requesting process must be delayed until the resource has been released.
Hold and wait –
Some processes must be holding some resources in nonshareable mode and at the same time must be waiting to acquire some more resources, which are currently held by other processes in non-shareable mode.
No pre-emption –
Resources granted to a process can be released back to the system only as a result of voluntary action of that process, after the process has completed its task.
Circular wait –
Deadlocked processes are involved in a circular chain such that each process holds one or more resources being requested by the next process in the chain.

Question(s):

1. Give one real-life example in Computers of Deadlock and how to prevent it from occurring?

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions