Deadlocks

Question 1

Prevent sets of concurrent prcesses from completing their tasksq

Answer 1

Deadlock

Question 2

Process utilization in a system model

Answer 2

REQUEST > USE > RELEASE

Question 3

Rag

R->P

Answer 3

Assignment edge

Question 4

Rag

P->R

Answer 4

Request edge

Question 5

If graph contains no cycle ->
If graph contains a cycle and one instance per resource type ->
If multiple instance per resource type ->

Answer 5

No deadlock
Deaflock
Possibility if deadlock

Question 6

Ensure that system will neber enter a deadlockq

Answer 6

Deadlock handling

Question 7

Allow system to enter deadlock syate tyen recover

Answer 7

Deadlock prevention

Question 8

Ignore the probelm and pretend that desflocks never occur in the system

Answer 8

Deadlock avoidance

Question 9

Avoidance algorithm of a single instance of a resource type

Answer 9

Resource allocation graph

Question 10

Recovery from deadlock where you abort all deadlock processes

Answer 10

Process termination

Question 11

Recovery from deadlock by RESOURCE PREEMPTION

3 ways

Answer 11

Selecting a victim - minimize cost
Rollback -return to safe state
Starvation - same process is picked a s avictim