+ Link For Assignments, GDBs & Online Quizzes Solution |
+ Link For Past Papers, Solved MCQs, Short Notes & More |
Dear Students,
Graded Discussion Board of CS 604 is announced now, and its due date is 26th Feb, 2015 to 27th Feb, 2015, be ready for that.
Topic is: "Is it possible to have a deadlock condition with a single process? Explain and justify your answer with reference to deadlock prevention method".
share your ideas friends!
Tags:
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)
+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)Name | Coffman conditions | Patented | Description |
---|---|---|---|
Banker's algorithm | Mutual exclusion | N/A | The Banker's algorithm is a resource allocation and deadlockavoidance algorithm developed by Edsger Dijkstra. |
Preventing recursive locks | Mutual exclusion | No | This prevents a single thread from entering the same lock more than once. |
according to my search there is no way any possibilty to have a deadlock condition in a single process.only in single process ,The deadlock includes in a circular “hold-and-wait” condition between two or more processes,It is not possible to have a deadlock involving . so “one” process cannot hold a resource, yet be waiting for another resource that it is holding. moreover, deadlock is not possible between two threads in a process, because it is a process that holds resources, not the thread that is, every thread has access held by the process to the resources.
these are four conditions that are able to achieve deadlock:
Mutual Exclusion :In a non-sharable mode at least one resource must be held ; If there is any other process requests this resource, then that process must wait for the resource to be released.
Hold and Wait :It is necessary for a process simultaneously holding at least one resource & waiting for at least one resource that is at the time being held by some other process.
No preemption: Once a process has been granting its requests (providing resources)then until the process voluntarily releases it that resource cannot be taken away from that process .
Circular Wait: A set of processes { P0, P1, P2, . . ., PN } must have to exist such that every P[ i ] waiting for P[ ( i + 1 ) % ( N + 1 ) ]. ( Note that this condition implies the hold-and-wait condition(describing 3rd in above), but if the four are considered separately, it is relaxable to deal with the conditions.
Yes it is possible. google it and you will get a "yes" everywhere.
Although it is a very rare and uncommon case but yes , it is possible.
It may happen when a single process is waiting for an event that only it can cause.
Also check this.. i have Also found the result ..... "yes"
See the link below
http://hamilton.nuigalway.ie/teaching/AOS/FIVE/deadlock.html
© 2021 Created by + M.Tariq Malik.
Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
We have been working very hard since 2009 to facilitate in learning Read More. We can't keep up without your support. Donate.
We are user-generated contents site. All product, videos, pictures & others contents on site don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post