Question 4. Deadlock - Banker's Algorithm A system that uses the Banker's Algorithm has six processes and four types of reusable resources (R1, R2, R3 and R4). The current allocation, maximum needs (claims) and available resources are as shown below. Allocation Matrix (A) Claim Matrix (C) Available Vector (V) Process R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P1 3 2 4 6. 1 3 3 5 P2 8. 8. 8. P3 1. 4 4 2 1. 4. P4 1 1 7 1. P5 4 1. 1. 7 P6 0 1 1 1 1 Calculate the Needs matrix (Q) and then determine if this is a safe state? If so, give a sequence in which the processes can be serviced. If it is not a safe state then list the processes which are deadlocked. Show all your work and the content of available vector in each step clearly!

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

operating systems

Question 4. Deadlock - Banker's Algorithm
A system that uses the Banker's Algorithm has six processes and four types of reusable resources (R1, R2,
R3 and R4). The current allocation, maximum needs (claims) and available resources are as shown below.
Allocation Matrix (A)
Claim Matrix (C)
Available Vector (V)
Process
R1
R2
R3
R4
R1
R2
R3
R4
R1
R2
R3
R4
3 5
P1
1
4
6.
P2
8.
1.
8
4
P3
1
2
4
1.
P4
1
1
7
1.
P5
1
1
4
1
1
7
1 0 1
1 1 1
P6
Calculate the Needs matrix (Q) and then determine if this is a safe state? If so, give a sequence in which
the processes can be serviced. If it is not a safe state then list the processes which are deadlocked. Show
all your work and the content of available vector in each step clearly!
Needs Matrix (Q)
R1
R2
R3
R4
P1
P2
P3
P4
P5
P6
2.
Transcribed Image Text:Question 4. Deadlock - Banker's Algorithm A system that uses the Banker's Algorithm has six processes and four types of reusable resources (R1, R2, R3 and R4). The current allocation, maximum needs (claims) and available resources are as shown below. Allocation Matrix (A) Claim Matrix (C) Available Vector (V) Process R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 3 5 P1 1 4 6. P2 8. 1. 8 4 P3 1 2 4 1. P4 1 1 7 1. P5 1 1 4 1 1 7 1 0 1 1 1 1 P6 Calculate the Needs matrix (Q) and then determine if this is a safe state? If so, give a sequence in which the processes can be serviced. If it is not a safe state then list the processes which are deadlocked. Show all your work and the content of available vector in each step clearly! Needs Matrix (Q) R1 R2 R3 R4 P1 P2 P3 P4 P5 P6 2.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Networking
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education