Question

I need a help to solve this problem

I want to create a code that implement bounded buffer problem by using semaphore.
so use int buffer[10]; // buffer is global variable and buffersize is 10
and there is only one producer and one consumer.

1) Producer()
- At every 200msec, generates random positive integer and add to the buffer.
- Then print current state of buffer (numbers and in/out indices)
-Also print current state of two semaphore which are full and empty.
- After producing 20 numbers, producer ends
2) Consumer()
-At every 170msec, removes one integer from the buffer.
-And then print current state of buffer (that is numbers and in/out indices)
-Also print current state of two semaphore full and empty.
-After reading 20 numbers, consumer ends

So I want to use three semaphore that are full, empty, mutex and also use asleep() for delaying producer and consumer.

Answer 1

#include <iostream>
#include <windows.h>
#include <thread>
#include <time.h>//time(0)
#include<stdlib.h>
using namespace std;
int full = 0, mutex = 1, Empty = 10, buffer[10] = { 0 }, to_produce = 20, to_consume = 20;
//initialize variables to_produce and to_consume are variables to note quantity produced and consumed, don't confuse with Empty
void wait(int& S)//wait of semaphore
{
   while (S <= 0) {}
   S--;
}
void signal(int& S)//signal of semaphore
{
   S++;
}
void Producer()//producer
{
   do
   {
       Sleep(200);//every 200 ms
       wait(Empty);//decreememt Empty
       wait(mutex);//decreememt mutex
       to_produce--;//decreement to_produce
       buffer[full] = rand();
       cout << "\nProduced\t" << buffer[full] << endl;
       cout << endl;
       cout << "Full\t" << full+1 << endl;
       cout << "Empty\t" << Empty << endl;
       signal(mutex);//increement mutex
       signal(full);//increement full
   } while (to_produce > 0);
}
void Consumer()
{
   do
   {
       Sleep(170);//every 170 ms
       wait(full);//decreememt full
       wait(mutex);//decreememt mutex
       to_consume--;//decreememt to_consume
       cout << "\nConsumed\t" << buffer[full] << endl;
       buffer[full] = 0;//reset buffer[full]
       cout << endl;
       cout << "Full\t" << full << endl;
       cout << "Empty\t" << Empty+1 << endl;
       signal(mutex);//increement mutex
       signal(Empty);//increement Empty
   } while (to_consume > 0);
}
int main()
{
   srand(time(0));
   thread producer(Producer);
   thread consumer(Consumer);
   producer.join();
   cout << "\nproducer ended\n";
   consumer.join();
   cout << "\nconsumer ended\n";
}

Produced Full Empty 9 Consumed 0 Full Empty 10 Produced 18467 Full Empty 9 Consumed 18467 0 Full Empty 10 Produced 6334 Full Empty 9 Consumed 6334 0 Full Empty 10 Produced 26500 Full Empty 9 Consumed 26500 0 Full Empty 10 19169 Produced Full Empty 9 19169 Consumed 0 Full Empty 10 Produced 15724 Full Empty 9 Consumed 15724 0 Full Empty 10

11478 Produced Full Empty 9 11478 Consumed 0 Full Empty 10 29358 Produced Full Empty 9 29358 Consumed 0 Full Empty 10 Produced 26962 Full Empty 9 Consumed 26962 0 Full Empty 10 24464 Produced Full Empty 9 24464 Consumed 0 Full Empty 10 5705 Produced Full Empty 9 5705 Consumed 0 Full Empty 10 Produced 28145 Full Empty 9 Consumed 28145 0 Full Empty 10

Produced 23281 Full Empty 9 Consumed 23281 Full 0 Empty 10 Produced 16827 Full Empty 9 Consumed 16827 Full 0 Empty 10 Produced 9961 Full Empty 9 Consumed 9961 Full 0 Empty 10 Produced 491 Full Empty 9 Consumed 491 Full Empty 10 0 Produced 2995 Full Empty 9 Consumed 2995 Full Empty 10 0 Produced 11942 Full Empty 9 Consumed 11942 Full Empty 10 0

Produced 4827 Full 1 Empty 9 Consumed 4827 Full 0 Empty 10 Produced 5436 Full 1 Empty 9 Consumed 5436 Full 0 Empty 10 producer ended consumer ended

COMMENT DOWN FOR ANY QUERY

PLEASE GIVE A THUMBS UP