Deadlocks Flashcards

1
Q

what is a deadlock

A

when a process in a state “s” if the process is blocked in “s” and if no matter what state transition occur in the future, the process will remain blocked

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what is the maximum claim of a process?

A

the set of all resources the process may ever request

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

what is a resource claim graph?

A

an extension of resource allocation graph but also including the potential future resources

How well did you know this?
1
Not at all
2
3
4
5
Perfectly