A dispatcher of RTOS has the following three resources, A, B, and C. A has 7 instances, B has 5 instances, and Chas 6 instances. At this time, the allocation, request and available map is shown in table Q1 below. a. Is this system in a safe state? Execute necessary algorithm to show your result. b. Is there a valid sequence that can work for this map? If so show it and state if it is the only one or not. C. Given the allocation table below, if PO requests 1 more resource from A and it is granted, will the system be in a safe state? d. Given the allocation table below, if C has a total of 5 slots that will leave C with only 1 available instance, will the system be in a safe state? If not, suggest a solution to overcome deadlock. Table Q1 Allocation Requested Available C A PO 1. 1. P1 P2 3 1. P3 4 U o N 1. 2. 1. 1. 1. 1.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
A dispatcher of RTOS has the following three resources, A, B, and C. A has 7 instances, B has 5
instances, and C has 6 instances. At this time, the allocation, request and available map is shown
in table Q1 below.
a. Is this system in a safe state? Execute necessary algorithm to show your result.
b. Is there a valid sequence that can work for this map? If so show it and state if
it is the only one or not.
c. Given the allocation table below, if PO requests 1 more resource from A and it
is granted, will the system be in a safe state?
d. Given the allocation table below, if C has a total of 5 slots that will leave C with
only 1 available instance, will the system be in a safe state? If not, suggest a
solution to overcome deadlock.
Table Ql
Allocation
Requested
Available
C
PO
1.
2.
P1
P2
1.
1.
P3
1.
2.
4
A HO 12
Transcribed Image Text:A dispatcher of RTOS has the following three resources, A, B, and C. A has 7 instances, B has 5 instances, and C has 6 instances. At this time, the allocation, request and available map is shown in table Q1 below. a. Is this system in a safe state? Execute necessary algorithm to show your result. b. Is there a valid sequence that can work for this map? If so show it and state if it is the only one or not. c. Given the allocation table below, if PO requests 1 more resource from A and it is granted, will the system be in a safe state? d. Given the allocation table below, if C has a total of 5 slots that will leave C with only 1 available instance, will the system be in a safe state? If not, suggest a solution to overcome deadlock. Table Ql Allocation Requested Available C PO 1. 2. P1 P2 1. 1. P3 1. 2. 4 A HO 12
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY