2. In the first problem, there were 9 processes, many of which were listed as pairs under the precedence relation. Suppose we are dealing with a system of only 5 processes named P1 through P5. You are given a set of constraints that are expressed by the following precedence relation: > (P1,P3), (P1, PS5), (P2,P4), (P3, P4), (P4, P5)} Provide pseudocode to show how you can use semaphores to enforce these constraints (i.e., the precedence relation →).

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

PLEASE ONLY NEED ANSWER FOR QUESTION 2 (THE PSEUDOCODE)

THANKS

1. Consider a system of 9 processes, P = {p1, ., p9).
Associated with the system are 6 memory cells, M = {M1,., M6).
The domain and range for each process is given in the following table:
Process pi
Domain D(pi)
Range R(pi)
p1
M1, M2
M3
p2
M1
M5
p3
p4
М3, М4
М3, М4
M1
M5
p5
M3
M4
рб
M4
M4
p7
M5
M5
p8
МЗ, М4
M2
p9
M5, M6
M6
In addition, you are given the following precedence relation:
> = {(P1,P2), (P1,P6), (P2,P3), (P2,P4), (P2,P5),(P3,P6),(P3,P8),(P4,P6),
(P4,P7), (P5,P7), (P5,P8), (P6,P8), (P6,P9), (P7,P9), (P8,P9)}
a. Construct the Precedence Graph (not containing any redundant edges). Use PowerPoint,
diagrams.net, or any other app to draw the graph.
b. Determine if the system above is always determinate. If it is not, add to necessary
elements to make it determinate.
2. In the first problem, there were 9 processes, many of which were listed as pairs under the
precedence relation. Suppose we are dealing with a system of only 5 processes named P1 through
P5. You are given a set of constraints that are expressed by the following precedence relation:
> = {(P1,P3), (P1, P5), (P2,P4), (P3, P4), (P4, P5)}
Provide pseudocode to show how you can use semaphores to enforce these constraints (i.e., the
precedence relation →).
Transcribed Image Text:1. Consider a system of 9 processes, P = {p1, ., p9). Associated with the system are 6 memory cells, M = {M1,., M6). The domain and range for each process is given in the following table: Process pi Domain D(pi) Range R(pi) p1 M1, M2 M3 p2 M1 M5 p3 p4 М3, М4 М3, М4 M1 M5 p5 M3 M4 рб M4 M4 p7 M5 M5 p8 МЗ, М4 M2 p9 M5, M6 M6 In addition, you are given the following precedence relation: > = {(P1,P2), (P1,P6), (P2,P3), (P2,P4), (P2,P5),(P3,P6),(P3,P8),(P4,P6), (P4,P7), (P5,P7), (P5,P8), (P6,P8), (P6,P9), (P7,P9), (P8,P9)} a. Construct the Precedence Graph (not containing any redundant edges). Use PowerPoint, diagrams.net, or any other app to draw the graph. b. Determine if the system above is always determinate. If it is not, add to necessary elements to make it determinate. 2. In the first problem, there were 9 processes, many of which were listed as pairs under the precedence relation. Suppose we are dealing with a system of only 5 processes named P1 through P5. You are given a set of constraints that are expressed by the following precedence relation: > = {(P1,P3), (P1, P5), (P2,P4), (P3, P4), (P4, P5)} Provide pseudocode to show how you can use semaphores to enforce these constraints (i.e., the precedence relation →).
Expert Solution
Step 1

Answer:-

(P1,P3), (P1,P5), (P2,P4), (P3,P4), (P4,P5)

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 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