Consider the following snapshot of a system:

6.3kviews

written 3.9 years ago by

shahed_ahmed • 20

modified 3.9 years ago by

binitamayekar ★ 6.7k

Using the banker’s algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the threads may complete. Otherwise, illustrate why the state is unsafe. • Available = (4, 2, 5, 3) • Available = (1, 5, 0, 2)

enter image description here

operating systems

ADD COMMENT EDIT

1 Answer

341views

written 3.9 years ago by

binitamayekar ★ 6.7k

Banker's Algorithm

First Calculate the Need Matrix

Need [i] = Max [i] - Allocation [I]

Need for P0: (4, 3, 2, 6) – (1, 2, 0, 2) = (3, 1, 2, 4)

Need for P1: (2, 4, 1, 4) – (0, 1, 1, 2) = (2, 3, 0, 2)

Need …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.