Modify the producer-consumer implementation code bellow, so that it uses monitors to handle race conditions instead of semaphores or mutexes. Use the pthread library implementation #include #include #include #include #define BUFFER_SIZE 20 pthread_mutex_t mutex;   int count = 0;   int buffer[BUFFER_SIZE];   pthread_t tid;   int producers = 0, consumers = 0;   void insert(int item) {   while (count == BUFFER_SIZE);   if (count < BUFFER_SIZE)   {   buffer[producers] = item;   producers++; producers=producers%BUFFER_SIZE;    sleep(1); }   return; }   int remove_item() {   int item;   while (count == 0);   if (count > 0)   {   item = buffer[consumers];   buffer[consumers] = buffer[consumers - 1];   consumers++; consumers=consumers%BUFFER_SIZE; sleep(1); }   return item; }   void * producer(void *param) {   int item;   while (1)   {   item = rand() % BUFFER_SIZE;   while (count >= BUFFER_SIZE);   pthread_mutex_lock(&mutex);   insert(item);   pthread_mutex_unlock(&mutex);   count++;   printf("in: %d ", producers);   printf("inserted: %d\n", item); } }   void * consumer(void *param) {   int item;   while (1)   {   while (count <= 0);   pthread_mutex_lock(&mutex);   item = remove_item();   pthread_mutex_unlock(&mutex);   count--;   printf("out: %d ", consumers);   printf("removed: %d\n", item); } }   int main(int argc, char *argv[]) {   int producers = atoi(argv[1]);   int consumers = atoi(argv[2]);   int i;   for (i = 0; i < producers; i++)   pthread_create(&tid, NULL, producer, NULL);   for (i = 0; i < consumers; i++)   pthread_create(&tid, NULL, consumer, NULL);   pthread_join(tid, NULL); }

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

Modify the producer-consumer implementation code bellow, so that it uses monitors to handle race conditions instead of semaphores or mutexes.

Use the pthread library implementation

#include <pthread.h>

#include <semaphore.h>

#include <stdio.h>

#include <stdlib.h>

#define BUFFER_SIZE 20

pthread_mutex_t mutex;

 

int count = 0;

 

int buffer[BUFFER_SIZE];

 

pthread_t tid;

 

int producers = 0, consumers = 0;

 

void insert(int item)

{

 

while (count == BUFFER_SIZE);

 

if (count < BUFFER_SIZE)

 

{

 

buffer[producers] = item;

 

producers++;

producers=producers%BUFFER_SIZE;

  

sleep(1);

}

 

return;

}

 

int remove_item()

{

 

int item;

 

while (count == 0);

 

if (count > 0)

 

{

 

item = buffer[consumers];

 

buffer[consumers] = buffer[consumers - 1];

 

consumers++;

consumers=consumers%BUFFER_SIZE;

sleep(1);

}

 

return item;

}

 

void *

producer(void *param)

{

 

int item;

 

while (1)

 

{

 

item = rand() % BUFFER_SIZE;

 

while (count >= BUFFER_SIZE);

 

pthread_mutex_lock(&mutex);

 

insert(item);

 

pthread_mutex_unlock(&mutex);

 

count++;

 

printf("in: %d ", producers);

 

printf("inserted: %d\n", item);

}

}

 

void *

consumer(void *param)

{

 

int item;

 

while (1)

 

{

 

while (count <= 0);

 

pthread_mutex_lock(&mutex);

 

item = remove_item();

 

pthread_mutex_unlock(&mutex);

 

count--;

 

printf("out: %d ", consumers);

 

printf("removed: %d\n", item);

}

}

 

int main(int argc, char *argv[])

{

 

int producers = atoi(argv[1]);

 

int consumers = atoi(argv[2]);

 

int i;

 

for (i = 0; i < producers; i++)

 

pthread_create(&tid, NULL, producer, NULL);

 

for (i = 0; i < consumers; i++)

 

pthread_create(&tid, NULL, consumer, NULL);

 

pthread_join(tid, NULL);

}

Expert Solution
steps

Step by step

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