We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

Looking For Something at vustudents.ning.com? Click Here to Search

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

# Graded Discussion Board for the course 'Operating Systems will be open on thursday 26th feb, 2015 to 27th feb,2015

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!

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

See Your Saved Posts Timeline

Views: 2763

.

+ 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)

### Replies to This Discussion

is it possible to have a deadlock in single process ? i mean single process me deadlock kaise :-o anyone explain this point ?

single process hone k bawajood deadlock ho skta hy ye sure ho gya hy discussion start kr lo bhai log .....

No, There is no possibility to have dead lock in case of single process.

rite

right

wohi wala rit

Deadlock Introduction............ () A set of process is in a deadlock state if each process in the set is waiting for an event that can be caused by only another process in the set. In other words, each member of the set of deadlock processes is waiting for a resource that can be released only by a deadlock process. None of the processes can run, none of them can release any resources, and none of them can be awakened. It is important to note that the number of processes and the number and kind of resources possessed and requested are unimportant.

Coffman (1971) identified four (4) conditions that must hold simultaneously for there to be a deadlock.
1. Mutual Exclusion Condition The resources involved are non-shareable. Explanation: At least one resource (thread) must be held in a non-sharea
ble mode, that is, only one process at a time claims exclusive control of the resource. If another process requests that resource, the requesting process must be delayed until the resource has been released.

2. Hold and Wait Condition Requesting process hold already, resources while waiting for requested resources. Explanation: There must exist a process that is holding a resource already allocated to it while waiting for additional resource that are currently being held by other processes.

3. No-Preemptive Condition Resources already allocated to a process cannot be preempted. Explanation: Resources cannot be removed from the processes are used to completion or released voluntarily by the process holding it.

4. Circular Wait Condition The processes in the system form a circular list or chain where each process in the list is waiting for a resource held by the next process in the list.

T

There is no possibilities for deadlock for the single process. Wht you thinks guys?

Answer:

No, it is not possible to have a deadlock condition in a single process.It is not possible to have a deadlock involving only one single process. The deadlock involves a circular “hold-and-wait” condition between two or more processes, so “one” process cannot hold a resource, yet be waiting for another resource that it is holding. In addition, deadlock is not possible between two threads in a process, because it is the process that holds resources, not the thread that is, each thread has access to the resources held by the process.

There are four conditions that are necessary to achieve deadlock:

1. Mutual Exclusion - At least one resource must be held in a non-sharable mode; If any other process requests this resource, then that process must wait for the resource to be released.
2. Hold and Wait - A process must be simultaneously holding at least one resource and waiting for at least one resource that is currently being held by some other process.
3. No preemption - Once a process is holding a resource ( i.e. once its request has been granted ), then that resource cannot be taken away from that process until the process voluntarily releases it.
4. Circular Wait - A set of processes { P0, P1, P2, . . ., PN } must exist such that every P[ i ] is waiting for P[ ( i + 1 ) % ( N + 1 ) ]. ( Note that this condition implies the hold-and-wait condition, but it is easier to deal with the conditions if the four are considered separately. )

## Latest Activity

2.O posted a discussion

### Aunties Always Poke Me :P :P

1 hour ago
+ ! ! ! ! ! ! ! ! ! AG liked Biya's discussion Waqat Dolat Rishty. . .
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked Whispering Soul's discussion Mamu :D
3 hours ago
Rana Shoaib updated their profile
3 hours ago
3 hours ago
4 hours ago
4 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked Biya's discussion Waqat Or Samajh
4 hours ago
4 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked Biya's discussion Khoob Sorat Bat. . . . .
4 hours ago
4 hours ago
Raheela joined + M.Tariq Malik's group

### PAK301 Pakistan Studies

4 hours ago
Raheela joined + M.Tariq Malik's group

### MTH101 Calculus And Analytical Geometry

4 hours ago
4 hours ago
Raheela joined + M.Tariq Malik's group

### ISL201 Islamic Studies

4 hours ago
Raheela joined + M.Tariq Malik's group

### ENG101 English Comprehension

4 hours ago
Raheela joined + M.Tariq Malik's group

### CS201 Introduction to Programming

4 hours ago
Raheela and Iqra Malik joined + M.Tariq Malik's group

4 hours ago
4 hours ago

## Today Top Members

1

2

3

### 23 October2019

© 2019   Created by + M.Tariq Malik.   Powered by