. A certain computation generates two arrays a and b such that a[i] = f for 0sisn and b[i] = g(a[i]) for 0si

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

Question below ,help

. A certain computation generates two arrays a
and b such that a[i] = f for 0Sisn and b[i] =
g(a[i]) for 0<i<n. Suppose this computation is
decomposed into two concurrent processes X and
Y such that X computes the array a and Y
computes the array b. The processes employ two
binary semaphores R and S, both initialized to
zero, The array a is shared by the two processes.
The structure of the processes are shown below.
%3D
%3D
Process X
Process Y
private i;
private i;
for (i = 0; i < n; i++) for (i = 0; i <n; i++)
%3D
%3D
{
a[i] = f(i);
ExitsX (R, S);
{
EntryY(R, S);
b[i] = g(a[i]);
}
Which one of the following represents the
CORRECT implementations of ExitsX and
EntryY?
(a) ExitsX (R, S) {
P(R);
V(S)
(b) ExitsX (R, S) {
V(R);
V(S);
EntryY(R, S) {
P(S);
V(R);
EntryY(R, S) {
P(R);
P(S);
(d) ExitsX (R, S) {
V(R);
P(S);
(c) ExitsX (R, S) {
P(S);
V(R)
Entry Y(R, S){
V(S);
P(R);
EntryY(R, S){
V(S);
P(R);
Transcribed Image Text:. A certain computation generates two arrays a and b such that a[i] = f for 0Sisn and b[i] = g(a[i]) for 0<i<n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two binary semaphores R and S, both initialized to zero, The array a is shared by the two processes. The structure of the processes are shown below. %3D %3D Process X Process Y private i; private i; for (i = 0; i < n; i++) for (i = 0; i <n; i++) %3D %3D { a[i] = f(i); ExitsX (R, S); { EntryY(R, S); b[i] = g(a[i]); } Which one of the following represents the CORRECT implementations of ExitsX and EntryY? (a) ExitsX (R, S) { P(R); V(S) (b) ExitsX (R, S) { V(R); V(S); EntryY(R, S) { P(S); V(R); EntryY(R, S) { P(R); P(S); (d) ExitsX (R, S) { V(R); P(S); (c) ExitsX (R, S) { P(S); V(R) Entry Y(R, S){ V(S); P(R); EntryY(R, S){ V(S); P(R);
Expert Solution
steps

Step by step

Solved in 2 steps

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