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
Q. What are the five main activities of an operating system in regard to process management? Answer: a. The creation as well as deletion of both user and system processes

BENEFITS OF THREADS OVER PROCESS If implemented correctly after those threads have some advantages of (multi) processes, they take: 1. Less time to create a new thread tha

Explain the Thread Local Storage (TLS)    Windows NT provides unique functions for per-thread data management. Thread local storage (TLS) is a concept defined in NT so develope

Q. a number of systems automatically delete all user files when a user logs off or a job terminates unless the user explicitly requests that they be kept other systems keep all fil

What is a file? A named collection of related data explained by the creator, recorded on secondary storage.

What are the functions of virtual file system (VFS)? a. It separates file-system-generic operations from their execution defining a clean VFS interface. It permits transparent

Q. Presume that a scheduling algorithm at the level of short-term CPU scheduling favours those processes that have used the least processor time in the recent past. Why this algori

Sharing segments between processes without requiring the same segment number is possible in a dynamically linked segmentation system. a. Define a system that permits sta

What is the main advantage of multiprogramming? Multiprogramming makes efficient use of the CPU by overlapping the demands for the CPU and its I/O devices from various users. I

As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward