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

Ask an Expert

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

Write your message here..

Related Questions

Explain working of the logical file system, Explain working of the logical ... Explain working of the logical file system The logical file system manages metadata information. Metadata contains all of the file-system structure, excluding actual data. It h

Hardware and software requirements for virtual memory?, What are the hardwa... What are the hardware and software requirements for virtual memory? The hardware required for virtual memory is a secondary memory and page table. The page table should have th

Explain the concept of mutual exclusion, Question 1: (a) Discuss about... Question 1: (a) Discuss about the evolution of operating systems from mainframe batch systems to mainframe time sharing systems. (b) Explain your understanding of the "sus

Explain what isam, Explain what ISAM is. Indexed sequential access meth... Explain what ISAM is. Indexed sequential access method. The file is stored in sorted order. ISAM has a master index file, indicating in what part of another index file the key

Contiguous-memory allocation, Compare contiguous-memory allocation with pur... Compare contiguous-memory allocation with pure paging in the following aspects: 1. In support of dynamic memory allocation: most systems allow programs to allocate more memory t

Principles of operating systems, Objective - Tiny Shell (tish) In this... Objective - Tiny Shell (tish) In this exercise you will write a small shell program to run different programs in foreground and background mode. Background Usually when

What is segmentation?, SEGMENTATION In a memory management system that ... SEGMENTATION In a memory management system that is properly a programmer views a program to be collection of program components called as segments . Every segment is a logical

BC0056, Write a C program that illustrates the creation of child process us... Write a C program that illustrates the creation of child process using fork system call. One process finds sum of even series and other process finds sum of odd series.

Explain the general structure of a typical process, Explain the general str... Explain the general structure of a typical process? There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-

Multi user systems technology, describe main points of multiuser and multi ... describe main points of multiuser and multi tasking operating systems.