Explain data structures used in bankers algorithm

21kviews

written 9.5 years ago by

teamques10 ★ 70k

modified 3.1 years ago by

sagarkolekar ★ 11k

operating systems

ADD COMMENT EDIT

1 Answer

1.8kviews

written 9.5 years ago by

teamques10 ★ 70k

The banker’s algorithm is a method used in deadlock avoidance technique in multiple instances of a resource type.

The various data structures used in it are:

Total_resource[ i ]: A 1-D matrix of size m .It stores the total number of resources in a system.
Max[i , j ]: A …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.