Question

data structures in the banker's algorithm is a vector of length m, where m is the number of resource types

a variant of the resource allocation graph used if all resources have only a single instance

system can allocate resources to each thread in some order and avoid a deadlock

assigned to its own resource

from thread Ti to resource Rj

directed graph used to describe a deadlock

deadlock avoidance algorithm used for resource allocation systems with multiple instances of each resource type

a sequence of thread where resources can be allocated without a deadlock

records whether each resource is free or allocated

from resource to thread

proves a set of methods to ensure that at last one of the necessary conditions cannot hold

indicates that a process may request a resource

requires that the operating system be given addition information in advance concerning which resource a thread will request

used by most operating systems

occurs when a thread continuously attempts an action that fails

========================================

Match Based on the above answers:-

Incidence of a lock

System table

Livelock

Resource allocation graph

Directed edge

Assignment edge

Claim edge

Available

Deadlock prevention

Deadlock avoidance

Do nothing about a deadlock

Safe state

Safe sequence

Baker’s algorithm

Wait-for graph

Answer 1

ANSWERS

1. Incidence of a lock - assigned to its own resource

2. System table - records whether each resource is free or allocated

3. Livelock- occurs when a thread continuously attempts an action that fails

4. Resource allocation graph - directed graph used to describe a deadlock

5. Directed edge- from thread Ti to resource Rj

6. Assignment edge- from resource to thread

7. Claim edge - indicates that a process may request a resource

8. Available - data structures in the banker's algorithm is a vector of length m, where m is the number of resource types

9. Deadlock Prevention- proves a set of methods to ensure that at last one of the necessary conditions cannot hold

10. Deadlock Avoidance - requires that the operating system be given additional information in advance concerning which resource a thread will request

11. Do nothing about deadlock - deadlock avoidance algorithm used for resource allocation systems with multiple instances of each resource type

12. Safe state- system can allocate resources to each thread in some order and avoid a deadlock

13. Safe sequence - a sequence of thread where resources can be allocated without a deadlock

14. Baker's algorithm- used by most operating systems

15. Wait-for graph - a variant of the resource allocation graph used if all resources have only a single instance.

Please comment if u need any other additional info. Please leave a like, it would mean a lot. Thanks :)