We can obtain the banker’s algorithm for a single resource type from the general banker’s algorithm simply by reducing the dimensionality of the various arrays by 1. Show through an example that the multipleresource-type banker’s scheme cannot be implemented by individual application of the single-resource-typescheme to each resource type.
Let Available = (2, 3,0)
Request = (0, 2, 0) for P0 is rejected since it will make the value of Available = ( 2, 1, 0) which will make no process to finish safely. Now let us treat 3 resources as single source resources of banker's algorithm:
.
Conclusion: The request for (0, 2, 0 ) for P0 is rejected while using banker's algorithm for multiple resource types since the final system reached is in an unsafe state. The request is GRANTED when we consider the banker's algorithm for three separate resources.
Hence proved that the multiple resource-type banker’s scheme cannot be implemented by individual application of the single-resource-type scheme to each resource type.
Get Answers For Free
Most questions answered within 1 hours.