Banker''s algorithm, Operating System

Consider the following snapshot of a system, answer the following questions using the banker's algorithm:

1. What is the content of the matrix Need? Is the system in a safe state?

2. If a request from Process P1 arrives for (0,4,2,0), can the request be granted immediately?

(Please show the intermediate steps besides final answer)

Process

Allocation

ABCD

Max

ABCD

Available

ABCD

P0

0 0 1 2

0 0 1 2

1 5 2 0

P1

1 0 0 0

1 7 5 0

 

P2

1 3 5 4

2 3 5 6

 

P3

0 6 3 2

0 6 5 2

 

P4

0 0 1 4

0 6 5 6

 

Posted Date: 4/2/2013 4:05:24 AM | Location : United States







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

Write discussion on Banker''s algorithm
Your posts are moderated
Related Questions
Question : a) What do you understand by a Directory Structure? Support your answer with a diagram. b) Give an example how Access Lists and Groups are arranged to mode of

Enhanced second-chance algorithm. When we increase the second-chance algorithm by considering both the reference bit and the modify bit as an order pair. We have the following

Processes and Programs Process is a dynamic entity which is a program in execution. A process is a sequence of information executions. Process exists in a limited span of t

Describe the purpose of the checkpoint mechanism. How habitually must checkpoints be performed? Explain how the frequency of checkpoints affects: System performance while no

Q. Several CPUs provide for more than two modes of operation. What are two probable uses of these multiple modes? Answer: Although most systems merely distinguish between use

Q. Dynamically loadable kernel modules give elasticity when drivers are added to a system however do they have disadvantages too? Under what situations would a kernel be compiled

Q. Distinguish among PCS and SCS scheduling. Answer: PCS scheduling is completed local to the process. It is how a thread library schedules threads onto available LWPs. SCS sch

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

Q. List three instances of deadlocks that aren't related to a computer system environment. Answer: Two cars passage a single-lane bridge from opposite directions.

Q. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers