Questions tagged [deadlocks]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
0
votes
1answer
807 views

Deadlock and safe state

I read that system being in safe state doesn't guarantee that deadlock is not possible. Can someone give me an example where system is in safe state and deadlock is possible?
0
votes
1answer
62 views

Deadlock not possible?

System is in safe state if there exists a safe sequence of all processes. Sequence $[P_1, P_2 …P_n]$ is safe, if for each $P_i$ the resources that can still request can be satisfied by $P_i$ ...
0
votes
1answer
218 views

Is bounded waiting satisfied in this 2 process solution?

Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes: ...
0
votes
0answers
10 views

Does a safe state ensures there will never ever be a deadlock?

In Banker's algorithm of deadlock avoidance, if one can obtain a safe state, does that necessarily mean there will never be a deadlock, or is there still some way that the system could fall into a ...
0
votes
0answers
42 views

What are necessity and sufficiency?

I was reading deadlock topic from Operating Systems book by Stallings. It states four pre requisites for deadlock: Mutual exclusion No preemption Hold and wait Circular wait It then have following ...
0
votes
0answers
47 views

How can I solve this deadlock related problem mathematically?

I came across following problem: A system has n resources R0,…,Rn-1,and k processes P0,….Pk-1.The implementation of the resource request logic of each process Pi is as follows: ...
0
votes
0answers
40 views

Banker's algorithm

I have a question regarding the banker's algorithm step 2. When it says the Need[i] <= work. Need is an n * m matrix and work is a vector of length m. I want to know what Need[i] <= Work means. ...
0
votes
0answers
27 views

Deadlock necessary conditions [duplicate]

I read that the 4 conditions for deadlock prevention are necessary conditions and not sufficient. The four necessary conditions are :- Mutual exclusion. Hold and wait. No preemption. Circular wait. ...
0
votes
0answers
189 views

2 phase locking with added increment mode

Suppose that a DBMS recognizes increment as an atomic operation, in addition to the read and ...
-1
votes
1answer
88 views

I have a question about resource alocation to avoid dead lock

In the code below, three processes are competing for six resources labeled A to F.How can I modify the get request in each procedure in this graph to avoid dead lock You cannot move requests ...
-2
votes
2answers
54 views

Deadlocks in operating System

Consider a system with 6 processes, where each process needs 2 copies of Resource R. The maximum units of R required to cause deadlock is ??
-3
votes
1answer
386 views

A Dead-lock in an Operating System is

A Dead-lock in an Operating System is Desirable process Undesirable process Definite waiting process All of the above My attempt: As "If a process is unable to change its state indefinitely because ...