What is Concurrency? Expain with example Deadlock and
Starvation?
- 5 Answers
- 17739 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / manoj
Deadlocks and Starvation
Readings: Chapter on Deadlocks in Tanenbaum. You can skip
Deadlock
Detection and Banker’s Algorithm.
· We looked at solving synchronization problems using
monitors and
semaphores.
· Unfortunately, problems can arise
Example 1:
Recall our solution to the reader-writer problem. It was
possible for
readers to wait indefinitely if new writers kept coming in.
On the other hand, writers would not wait indefinitely as
long as ready
threads are served in order.
Why?Thread A Thread B
lock(x)
lock(y)
Use resource X and Y
Unlock(y)
Unlock(x)
Lock(y)
Lock(x)
Use resource X and Y
Unlock(x)
Unlock(y)
In this case, it is possible that both Thread A and Thread B
wait
indefinitely for each other, with no progress being made.
What is common and different between the above examples?
Common aspect: Both problems involve threads waiting for
resources to
become available. They can also involve
· Resources: things needed by a thread to do its job a
thread *waits*
for resources
o e.g., locks, AW+WW = 0 (i.e., database is free from active or
waiting writers), disk blocks, memory pages
· Indefinite wait: In both examples, a thread may end up waiting
indefinitely.
Differences between the two examples: The type of waiting is
different.
· Starvation
A thread may wait indefinitely because other threads keep coming
in and getting the requested resources before this thread
does. Note that
resource is being actively used and the thread will stop
waiting if other
threads stop coming in.
· Deadlocks
A group of threads are waiting for resources held by others
in the
group. None of them will ever make progress.
Example 1 has starvation, but Example 2 does not.
A solution to a synchronization problem suffers from the
starvation
problem if starvation is a possibility. Usually, differences
in priorities can
lead to starvation. Lower priority threads starve if higher
priority threads
keep requesting the resources.
A solution suffers from the deadlock problem if a deadlock
is a possibility.
In Example 2, will a deadlock always occur?
| Is This Answer Correct ? | 1 Yes | 4 No |
Post New Answer View All Answers
Where are the global variables stored?
Tell me about virtual memory?
How often should I run chkdsk?
What resources are used when a thread created? How do they differ from those when a process is created?
What is eide?
What is ecc in reference to ram?
Tell me about different OS related issues for a given set of C-programs (mainly address issues address space, paging etc.)
Which event determines that all the controls are completely loaded into memory?
How do I run chkdsk?
How do I know if I have a 64 bit processor?
How much ram can xp handle?
What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem?
How do I know if my hardware supports 64 bit?
Describe horizontal scalability and vertical scalability.
Explain demand paging, page fault interrupt, and trashing?
