Operating System:

The following is the complete Bounded Buffer program for multiple producers and consumers based on the semaphores.

Rewrite the program to solve the bounded-buffer problem with a monitor (condition variables).

Reminder: the bounded buffer problem is to allow concurrent access to the Buffer by producers and consumers, while ensuring that:

1) The shared Buffer data structure is not screwed up by race condition in accessing it.

2) consumers don't try to remove objects from Buffer when it's empty.

3) Producers don't try to add objects to the Buffer when it's full.

The code:

typeT buf[n]; //an array of some type.

int front = 0;

int rear = 0;

semaphore empty = n, full = 0, mutex = 1;

void produce(typeT date){

wait(empty);

wait(mutex);

buf{rear] = data;

rear = (rear + 1) % n;

signal(mutex);

signal(full);

}

void consume(typeT &result){

wait(full);

wait(mutex);

result = buff[ front ];

front = ( front + 1 ) % n;

signal(mutex);

signal(empty);

}