Chapter 29 Flashcards

1
Q

What are 2 techniques for the recovery of deadlock

A
  1. Process termination

2. Resource preemption

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

How deadlock detection works

A

Allow system to enter a deadlock state. There is detection algorithm to detect deadlock. If deadlock found then recovery of system.

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

What algorithm used for deadlock detection in single instance resource type

A

Wait-for graph

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

What are types of nodes in resource allocation graph

A

Processes and resource

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

What is available data structure in bankers algorithm

A

It tells available instances of resources

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

What are 3 possibilities of invoking deadlock detection algorithm

A
  1. Run deadlock detection algorithm every time request can not be granted immediately. It is very expensive.
  2. Monitor CPU utilization and when it lowers to some watermark then run detection algorithm
  3. Run detection algorithm arbitrarily
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are 2 ways in Process termination

A
  1. kill all processes in deadlock

2. kill processes one by one and check if system came out of deadlock or not

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

What is resource preemption

A

Take resources from process so deadlock break

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

What is rollback in resource preemption

A

Process return to some safe state, restart process from that state.

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

What are 3 main issues in resource preemption

A
  1. Selecting a victim
  2. Rollback
  3. Starvation
How well did you know this?
1
Not at all
2
3
4
5
Perfectly