Questions tagged [deadlocks]
In OS, a deadlock is where two or more processes are waiting indefinitely for an event that can be caused by one of the waiting processes. Deadlock is a common problem in distributed systems, parallel computing & multiprocessing systems.
75
questions
0
votes
0
answers
22
views
Deadlock in LockTwo Algorithm
I was reading the Book: The Art of Multiprocessor Programming; Section 2.3.2. and I have a doubt regarding their $\texttt{LockTwo}$ algorithm mentioned in Page 26.
The snippet of the algorithm is:
<...
- 103
0
votes
1
answer
54
views
Reader / writer locking algorithm
I'm pretty sure there's a textbook solution to this problem, but I haven't figured it out.
I have fixed-size blocks of data arranged in a sequence: block 0, block 1, etc.. There are reader threads ...
- 129
1
vote
1
answer
259
views
Deadlocks: Why if 2 threads are waiting for a lock from each other results in a deadlock?
I am confused as to why 2 threads waiting for a lock from each other will result in a deadlock. Let's say I have a Thread 1 that needs to execute contents in Lock 1 and then Lock 2 and a Thread 2 that ...
- 213
0
votes
3
answers
359
views
In Operating Systems, I can't understand why deadlock happens, why does a process not let go of a resource when it is done using it?
I know deadlock occurs when Process A has resource R1 and is waiting for resource R2, while process B has resource R2 and is waiting for resource R1, however why don't both processes just let go of ...
1
vote
0
answers
96
views
Starvation and Livelock
I think Option C is false. Following is my thought process:
Starvation in general mean Process is waiting indefinitely for the resource or to get scheduled etc. [A/c to Galvin Book]. So, here in this ...
- 41
0
votes
0
answers
30
views
Different ways to avoid deadlocks
I am thinking of techniques that we can implement in order to avoid deadlocks in processes. While I am aware of some tactics, e.g. killing a process when we reach a deadlock, or using spooling, would ...
1
vote
1
answer
889
views
How are semaphores and test-and-set instructions connected?
Cheers, so my textbook explains these parts very poorly, so I would gladly take any advice! I am confused between the test-and-set instructions, which per my book is a very common CPU instruction set, ...
0
votes
0
answers
88
views
Minimal number of resources such that the system is considered safe?
In a system with a single type of resource, there are 8 processes with the following maximal requirements:
Process
P1
P2
P3
P4
P5
P6
P7
P8
MAX
75
60
65
35
30
45
30
30
Specify the minimal value for ...
0
votes
0
answers
29
views
Deadlock still occurs
Is it in in a deadlocked state?
In this graph, there is a deadlock initially I think. Since P1 is holding R1 and waiting for R2; P2 is holding R2 and waiting for R1 and R3; P3 is holding R3 and ...
1
vote
1
answer
164
views
Exit a deadlock cycle
Suppose i have the following resource allocation graph with a deadlock cycle, i see why it is a deadlock cycle, what i don't get is how to recover from this cycle
i'm thinking about aborting a ...
- 111
1
vote
1
answer
152
views
Does Dekkers solutions to critical section problem ensure progress?
I was reading concurrency control section from Operating Systems book by William Stallings. In this book, he gives three attempts by Dekker to give solution to critical section problem:
Attempt 1
<...
- 1,637
-1
votes
2
answers
453
views
Is this a deadlock?
Consider we have two processes P1 and P2. There are also two semaphores M and N which are initialized to zero. Here's how they execute:
...
- 153
1
vote
0
answers
184
views
How to prove that an algorithm has no deadlock
I need to mathematically prove that this algorithm is deadlock-free:
...
-2
votes
2
answers
355
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 ??
- 1
0
votes
0
answers
148
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 ...
- 1,637
1
vote
1
answer
443
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:
...
- 1,637
1
vote
0
answers
27
views
Comparing wait-signal alternatives for synchronizing two piece of programs
I came across following problem:
A certain computation generates two arrays a and b such that ...
- 1,637
2
votes
1
answer
226
views
Designing solution to critical section problem with two semaphores vs single semaphore
I came across following problem:
Let two processes P1 and P2 are there:
...
- 1,637
2
votes
0
answers
38
views
Does this state certify to be called as a deadlock?
I came across following problem:
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others ...
- 1,637
1
vote
1
answer
171
views
Can 2-philosophers problem be analogous to dining philosophers problem?
Two philosophers A and B, two forks numbered "1", "2"; A needs both "1" and "2" for eating, so does B.
Is this theoretical a dining philosopher problem? I'm questioning about the forks philosopher A ...
- 13
2
votes
1
answer
562
views
Deadlock vs "Progress" requirement of the solution to the critical section problem
I came across following problem:
Consider following code:
...
- 1,637
1
vote
1
answer
1k
views
Can a safe state in Banker's Algorithm cause deadlock eventually?
I know that unsafe state does not always mean deadlock. That is a situation that banker's algorithm does not detect deadlock accurately. I am just wondering if there is any example of a safe state ...
- 113
1
vote
1
answer
827
views
What fraction of all combinations is guaranteed to be deadlock free?
I found this question in the exercise of Tanenbaum (operating systems):
Two processes, $A$ and $B$,each need three records $1, 2, \text{ and } 3$ in a database. If $A$ asks for them in the
order $...
- 317
3
votes
1
answer
1k
views
How do modern Operating Systems detect process starvation?
So first off do the modern operating systems like windows and linux have a method for detecting starvation? if not, why? and if they do, then how are they going to detect starvation of a process? (...
- 740
-1
votes
1
answer
208
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 ...
0
votes
0
answers
44
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. ...
- 261
1
vote
1
answer
53
views
deadlock caused by a cyle of locks ? unprobable event causing it or just a false intuition
Thanks a lot for your help.
I want to understand what really causes what I suppose to be a deadlock:
I have standards objects, let's call it 'Words' that contains 3 letters and a key; (it doesn t ...
- 113
3
votes
1
answer
959
views
Does starvation freedom imply progress?
The above answer taken from the book https://www.amazon.com/Operating-Systems-Sibsankar-Haldar/dp/8131730220 says starvation freedom may not imply progress as processes can be deadlocked.
I think ...
- 973
0
votes
0
answers
35
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.
...
- 391
1
vote
0
answers
54
views
2
votes
0
answers
2k
views
Resource Allocation Graph Algorithm
In the book Operating System Concepts, it is said that:
A claim edge $P_i \rightarrow R_j$ indicates that process $P_i$
may request resource $R_j$ at some time in the future.
[emphasis added]
...
- 169
0
votes
1
answer
1k
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?
- 973
1
vote
0
answers
60
views
Is a single starved process considered deadlocked?
In regard to the critical section problem, an algorithm that switches between allowing one of two processes, P1 or P2, to complete their critical section would cause starvation for P1 if P2 stayed in ...
- 11
4
votes
1
answer
2k
views
A real life system that faces and solves the dining philosophers problem
I'm looking for an application of the dining philosophers problem. Is there some real life system that faces the concurrency problem of "the dining philosophers problem" and implements a solution? I'...
- 223
7
votes
3
answers
2k
views
Bounded waiting and starvation free in critical section problem
I have 4 questions regarding relation between starvation and bounded waiting.
1.Does starvation-freedom imply deadlock-freedom?
My Answer:
From here,
definition of starvation free is
Freedom from ...
- 317
2
votes
1
answer
759
views
When will deadlock occur in this producer-consumer code
I was reading about Producer Consumer problem from Operating Systems by William Stallings where following code was given:
...
- 1,745
0
votes
2
answers
4k
views
difference between deadlock avoidance and detection
I know the difference between deadlock prevention and avoidance. But i want to know the difference between deadlock avoidance and detection. ?
- 239
6
votes
6
answers
6k
views
Does Deadlock imply Starvation
If there is a deadlock between the processes does that mean that there is starvation also?
My Thinking:
deadlock is no process using that resources , but starvation is like not giving chance to only ...
0
votes
1
answer
454
views
Is Bounded Waiting satisfied for this 2 process Solution?
This is my new post linked with my previous post.
Is bounded waiting satisfied in the 2 Process Solution?
The answer in that post was very useful and cleared many concepts, but I just want to apply ...
- 462
2
votes
1
answer
887
views
Is bounded waiting satisfied in the 2 Process Solution?
Suppose, There are $2$ processes $P1$ and $P2$.
It is given that Mutual Exclusion and Progress are satisfied by these $2$ processes.
Suppose, Programming protocol is designed such that CPU only ...
- 462
0
votes
1
answer
75
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$ ...
- 1,617
3
votes
1
answer
1k
views
Why deadlock in cigarette smokers problem
"The Little Book of Semaphores" (2nd Ed. by Allen B. Downey, section 4.5.1) as well as Wiki (link) mentioned that a trivial solution (as shown below) to the 'Cigarette smokers problem' will cause a ...
- 229
4
votes
1
answer
182
views
How does lack of deadlock relate to computability in process calculi?
I'm interested in knowing things about the computability of concurrent programs. If you had a Turing complete language that also let you branch off new programs but had no means of communication ...
- 3,790
-3
votes
1
answer
886
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 ...
0
votes
1
answer
873
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:
...
- 462
6
votes
1
answer
4k
views
How to satisfy bounded waiting in case of deadlock?
I have a doubt regarding bounded waiting.
Deadlock implies no Progress because the processes take indefinite time to decide who will enter the critical section .
But, Does deadlock implies no ...
- 462
2
votes
2
answers
9k
views
Bankers Algorithm-Is the system in safe state?
Could somebody please provide a step-through approach to solving the following problem using the Banker's Algorithm?
A system contains 10 units of resource class Ru. The resource requirements of ...
- 33
6
votes
1
answer
1k
views
Is this solution to the dining philosopher's problem entirely valid?
In a question on Stack Overflow, the answer by Patrick Trentin lists the following solution to the dining philosopher's problem:
A possible approach for avoiding deadlock without incurring
...
- 201
2
votes
0
answers
572
views
Given a program which when executed spawns two concurrent processes : semaphore X : = 0 ; Is it possible for process P1 and P2 to starve?
Given below is a program which when executed spawns two concurrent processes:
...
4
votes
2
answers
845
views
How probable is a deadlock in the dining philosophers problem
I created this simulation of the dining philosophers problem, but did not manage to initialize it with four philosophers without running into a deadlock:
*Philosophers are represented by black ...
