Briefly discuss on bankers algorithm, Operating System

Briefly discuss on Bankers algorithm?

The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples  for each resource type. So we go for bankers algorithm but is less well-organized that resource allocation graph scheme.

When a new procedure enters it must declare the maximum number of instances of every resource type that it may need. When a user request a set of resources, the system must verify whether the allocation of these resource will leave the system in a safe state. If it will the resources are allocated; otherwise the process must wait unless some other process releases enough resources.

 

Posted Date: 6/6/2013 6:39:40 AM | Location : United States







Related Discussions:- Briefly discuss on bankers algorithm, Assignment Help, Ask Question on Briefly discuss on bankers algorithm, Get Answer, Expert's Help, Briefly discuss on bankers algorithm Discussions

Write discussion on Briefly discuss on bankers algorithm
Your posts are moderated
Related Questions
Describe when you run an unlink() operation to remove a file on the ext3 file system. Be specific about what disk blocks have to be written where in what order. State your assumpti

There is a very small amount of networking background required for Project 2. In Project 2, we want our computer (or our "host") to request information over the Internet from a rem

Clocks in distributed systems : a. Why are clocks difficult to synchronize in distributed systems? b. What features in a system assume that the clocks are (reasonably) synchr

How the Nested Macro calls are expanded LIFO (Last in First out)

#question After working for 30 years, Ramjee Somjee Dutt opted for VRS and started a courier company and did very well in the first four years. He was now looking for expansion of


explain how response time are reduced by allowing time sharing on top of multiprogramming

What is sector sparing is proper definition

What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.

function of lazy swapper