Question

item nextProduced; while (1) { while (counter == BUFFER_SIZE); /* do nothing */ buffer[in] = nextProduced; in = (in + 1) % BUFFER_SIZE; counter++; }

          item nextProduced;
while (1) {
while (counter == BUFFER_SIZE); /* do nothing */
buffer[in] = nextProduced;
in = (in + 1) % BUFFER_SIZE;
counter++;
}

Added by Lorena A.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Tianyu Li

04/30/2022

Step 1

Define the problem. Show more…

Show all steps

Thanks for your feedback!

Subject: OPERATING SYSTEM Q) Elaborate the concept of shared memory model with the help of the producer-consumer problem. The producer-consumer problem discussed below is correct; however, it stores buffer_size-1 processes. How can we solve this issue? item nextProduced: while (1) { while (counter == BUFFER_SIZE); /* do nothing */ buffer[in] = nextProduced; in = (in + 1) % BUFFER_SIZE; counter++; }